TY - JOUR
T1 - Bi-objective parallel machine scheduling with additional resources during setups
AU - Yepes-Borrero, Juan C.
AU - Perea, Federico
AU - Ruiz, Rubén
AU - Villa, Fulgencia
N1 - Funding Information:
The authors would like to acknowledge 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 ) and grant MTM2016-74983 , from 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”, and from the “Generalitat Valenciana” under grant “NUevos REtos en SEcuenciación” (No. AICO/2020/049). Juan C. Yepes-Borrero acknowledges financial support by “El Instituto Colombiano de Crédito Educativo y Estudios Técnicos en el Exterior – ICETEX” under program “Pasaporte a la ciencia – Doctorado”, grant number 3568118.
Publisher Copyright:
© 2020 Elsevier B.V.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2020
Y1 - 2020
N2 - We present a bi-objective parallel machine scheduling problem with machine and job sequence dependent setup times, with the additional consideration of resources needed during setups. The availability of such resources is limited. This models many practical situations where setup times imply, for example, cleaning and/or the reconfiguration of productive equipment. These setups are performed by personnel, who are of course limited in number. The objectives considered are the minimization of the makespan and the minimization of the number of resources. Fewer available resources reduce production costs but inevitably increase the makespan. On the contrary, a greater number of resources increase costs but allow for more setups to be done in parallel and a reduced makespan. An algorithm based on iterated greedy approaches is proposed to search for the Pareto front of the problem. This algorithm is compared with state-of-the art methods adapted to the problem. Computational experiments, supported by statistical analyses, indicate that the proposed approach outperforms all other tested procedures.
AB - We present a bi-objective parallel machine scheduling problem with machine and job sequence dependent setup times, with the additional consideration of resources needed during setups. The availability of such resources is limited. This models many practical situations where setup times imply, for example, cleaning and/or the reconfiguration of productive equipment. These setups are performed by personnel, who are of course limited in number. The objectives considered are the minimization of the makespan and the minimization of the number of resources. Fewer available resources reduce production costs but inevitably increase the makespan. On the contrary, a greater number of resources increase costs but allow for more setups to be done in parallel and a reduced makespan. An algorithm based on iterated greedy approaches is proposed to search for the Pareto front of the problem. This algorithm is compared with state-of-the art methods adapted to the problem. Computational experiments, supported by statistical analyses, indicate that the proposed approach outperforms all other tested procedures.
UR - http://www.scopus.com/inward/record.url?scp=85096381796&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85096381796&partnerID=8YFLogxK
U2 - 10.1016/j.ejor.2020.10.052
DO - 10.1016/j.ejor.2020.10.052
M3 - Article
AN - SCOPUS:85096381796
SN - 0377-2217
JO - European Journal of Operational Research
JF - European Journal of Operational Research
ER -