TY - JOUR
T1 - GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources
AU - Yepes-Borrero, Juan C.
AU - Villa, Fulgencia
AU - Perea, Federico
AU - Caballero-Villalobos, Juan Pablo
N1 - Funding Information:
The first three authors would like to acknowledge the support from Spanish “Ministerio de Economia y competitividad” throughout grant number MTM2016-74983 and grant “SCHEYARD – Optimization of Scheduling Problems in Container Yards” (No. DPI2015-65895-R), financed by FEDER funds, the support from “Ministerio de Ciencia, Innovación y Universidades” under grant "Optimización de Operaciones en Terminales Portuarias (OPTEP)" (No.RTI2018-094940-B-100). Thanks are also due to the Universitat Politècnica de València under grant SP20180164 of the program Primeros Proyectos de Investigación (PAID-06-18), Vicerrectorado de Investigación, Innovación y Transferencia. Juan C. Yepes-Borrero acknowledges financial support by the El Instituto Colombiano de Crédito Educativo y Estudios Técnicos en el Exterior – ICETEX under program Pasaporte a la ciencia – Doctorado. Special thanks are due to two anonymous referees for their valuable comments.
Publisher Copyright:
© 2019 Elsevier Ltd
Copyright:
Copyright 2019 Elsevier B.V., All rights reserved.
PY - 2020/3/1
Y1 - 2020/3/1
N2 - This paper provides practitioners with new approaches for solving realistic scheduling problems that consider additional resources, which can be implemented on expert and intelligent systems and help decision making in realistic settings. More specifically, we study the unrelated parallel machine scheduling problem with setup times and additional limited resources in the setups (UPMSR-S), with makespan minimization criterion. This is a more realistic extension of the traditional problem, in which the setups are assumed to be done without using additional resources (e.g. workers). We propose three metaheuristics following two approaches: a first approach that ignores the information about additional resources in the constructive phase, and a second approach that takes into account this information about the resources. Computational experiments are carried out over a benchmark of small and large instances. After the computational analysis we conclude that the second approach shows an excellent performance, overcoming the first approach.
AB - This paper provides practitioners with new approaches for solving realistic scheduling problems that consider additional resources, which can be implemented on expert and intelligent systems and help decision making in realistic settings. More specifically, we study the unrelated parallel machine scheduling problem with setup times and additional limited resources in the setups (UPMSR-S), with makespan minimization criterion. This is a more realistic extension of the traditional problem, in which the setups are assumed to be done without using additional resources (e.g. workers). We propose three metaheuristics following two approaches: a first approach that ignores the information about additional resources in the constructive phase, and a second approach that takes into account this information about the resources. Computational experiments are carried out over a benchmark of small and large instances. After the computational analysis we conclude that the second approach shows an excellent performance, overcoming the first approach.
UR - http://www.scopus.com/inward/record.url?scp=85072616676&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85072616676&partnerID=8YFLogxK
U2 - 10.1016/j.eswa.2019.112959
DO - 10.1016/j.eswa.2019.112959
M3 - Article
AN - SCOPUS:85072616676
SN - 0957-4174
VL - 141
JO - Expert Systems with Applications
JF - Expert Systems with Applications
M1 - 112959
ER -