- -

Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource

Show full item record

Villa Juliá, MF.; Vallada Regalado, E.; Fanjul Peyró, L. (2018). Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource. Expert Systems with Applications. 93:28-38. https://doi.org/10.1016/j.eswa.2017.09.054

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/122887

Files in this item

Item Metadata

Title: Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat
Issued date:
Embargo end date: 2020-03-01
Abstract:
[EN] In this paper, we study the unrelated parallel machine scheduling problem with one scarce additional resource to minimise the maximum completion time of the jobs or makespan. Several heuristics are proposed following ...[+]
Subjects: Parallel machine problem , Scheduling , Additional resources , Heuristics , Makespan
Copyrigths: Embargado
Source:
Expert Systems with Applications. (issn: 0957-4174 )
DOI: 10.1016/j.eswa.2017.09.054
Publisher:
Elsevier
Publisher version: http://doi.org/10.1016/j.eswa.2017.09.054
Project ID: info:eu-repo/grantAgreement/EC/H2020/731932/EU
Thanks:
The authors are supported by the Spanish Ministry of Economy and Competitiveness, under the projects "SCHEYARD - Optimization of Scheduling Problems in Container Yards" (No. DPI2015-65895-R) and "OPTEMAC - Optimizacion de ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record