An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem

In the no-idle flowshop, machines cannot be idle after finishing one job and before starting the next one. Therefore, start times of jobs must be delayed to guarantee this constraint. In practice machines show this behavior as it might be technically unfeasible or uneconomical to stop a machine in b...

Descripción completa

Detalles Bibliográficos
Autores: Pan, Quan-Ke, Ruiz García, Rubén
Tipo de recurso: artículo
Fecha de publicación:2014
País:España
Institución:Universitat Politècnica de València (UPV)
Repositorio:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Idioma:inglés
OAI Identifier:oai:riunet.upv.es:10251/60278
Acceso en línea:https://riunet.upv.es/handle/10251/60278
Access Level:acceso abierto
Palabra clave:Flowshop
No-idle
Heuristics
Iterated greedy
Local search
ESTADISTICA E INVESTIGACION OPERATIVA
id ES_0bd7d8049c01adc69af6fb2ada35b080
oai_identifier_str oai:riunet.upv.es:10251/60278
network_acronym_str ES
network_name_str España
repository_id_str
dc.title.none.fl_str_mv An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem
title An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem
spellingShingle An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem
Pan, Quan-Ke
Flowshop
No-idle
Heuristics
Iterated greedy
Local search
ESTADISTICA E INVESTIGACION OPERATIVA
title_short An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem
title_full An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem
title_fullStr An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem
title_full_unstemmed An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem
title_sort An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problem
dc.creator.none.fl_str_mv Pan, Quan-Ke
Ruiz García, Rubén
author Pan, Quan-Ke
author_facet Pan, Quan-Ke
Ruiz García, Rubén
author_role author
author2 Ruiz García, Rubén
author2_role author
dc.contributor.none.fl_str_mv National Science Foundation, China
Ministerio de Economía y Competitividad
Universitat Politècnica de València
Program for New Century Excellent Talents in University, China
Northeastern University, China
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Flowshop
No-idle
Heuristics
Iterated greedy
Local search
ESTADISTICA E INVESTIGACION OPERATIVA
topic Flowshop
No-idle
Heuristics
Iterated greedy
Local search
ESTADISTICA E INVESTIGACION OPERATIVA
description In the no-idle flowshop, machines cannot be idle after finishing one job and before starting the next one. Therefore, start times of jobs must be delayed to guarantee this constraint. In practice machines show this behavior as it might be technically unfeasible or uneconomical to stop a machine in between jobs. This has important ramifications in the modern industry including fiber glass processing, foundries, production of integrated circuits and the steel making industry, among others. However, to assume that all machines in the shop have this no-idle constraint is not realistic. To the best of our knowledge, this is the first paper to study the mixed no-idle extension where only some machines have the no-idle constraint. We present a mixed integer programming model for this new problem and the equations to calculate the makespan. We also propose a set of formulas to accelerate the calculation of insertions that is used both in heuristics as well as in the local search procedures. An effective iterated greedy (IG) algorithm is proposed. We use an NEH-based heuristic to construct a high quality initial solution. A local search using the proposed accelerations is employed to emphasize intensification and exploration in the IG. A new destruction and construction procedure is also shown. To evaluate the proposed algorithm, we present several adaptations of other well-known and recent metaheuristics for the problem and conduct a comprehensive set of computational and statistical experiments with a total of 1750 instances. The results show that the proposed IG algorithm outperforms existing methods in the no-idle and in the mixed no-idle scenarios by a significant margin.
publishDate 2014
dc.date.none.fl_str_mv 2014
2014-04-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/60278
url https://riunet.upv.es/handle/10251/60278
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Ministerio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 DPI2012-36243-C02-01 REALISTIC EXTENDED SCHEDULING USING LIGHT TECHNIQUES
Universitat Politècnica de València https://doi.org/10.13039/501100004233 PAID-2012-202
National Natural Science Foundation of China https://doi.org/10.13039/501100001809 61174187
Program for New Century Excellent Talents in University, China https://doi.org/10.13039/501100004602 NCET-13-0106
Northeastern University, China https://doi.org/10.13039/501100004184 29321006
Northeastern University, China https://doi.org/10.13039/501100004184 N110208001
National Natural Science Foundation of China https://doi.org/10.13039/501100001809 2013020016
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869403250641338368
spelling An effective iterated greedy algorithm for the mixed no-idle flowshop scheduling problemPan, Quan-KeRuiz García, RubénFlowshopNo-idleHeuristicsIterated greedyLocal searchESTADISTICA E INVESTIGACION OPERATIVAIn the no-idle flowshop, machines cannot be idle after finishing one job and before starting the next one. Therefore, start times of jobs must be delayed to guarantee this constraint. In practice machines show this behavior as it might be technically unfeasible or uneconomical to stop a machine in between jobs. This has important ramifications in the modern industry including fiber glass processing, foundries, production of integrated circuits and the steel making industry, among others. However, to assume that all machines in the shop have this no-idle constraint is not realistic. To the best of our knowledge, this is the first paper to study the mixed no-idle extension where only some machines have the no-idle constraint. We present a mixed integer programming model for this new problem and the equations to calculate the makespan. We also propose a set of formulas to accelerate the calculation of insertions that is used both in heuristics as well as in the local search procedures. An effective iterated greedy (IG) algorithm is proposed. We use an NEH-based heuristic to construct a high quality initial solution. A local search using the proposed accelerations is employed to emphasize intensification and exploration in the IG. A new destruction and construction procedure is also shown. To evaluate the proposed algorithm, we present several adaptations of other well-known and recent metaheuristics for the problem and conduct a comprehensive set of computational and statistical experiments with a total of 1750 instances. The results show that the proposed IG algorithm outperforms existing methods in the no-idle and in the mixed no-idle scenarios by a significant margin.Quan-Ke Pan is partially supported by the National Science Foundation of China 61174187, Program for New Century Excellent Talents in University (NCET-13-0106), Science Foundation of Liaoning Province in China (2013020016), Basic scientific research foundation of Northeast University under Grant N110208001, Starting foundation of Northeast University under Grant 29321006, and Shandong Province Key Laboratory of Intelligent Information Processing and Network Security (Liaocheng University). Ruben Ruiz is partially supported by the Spanish Ministry of Economy and Competitiveness, under the project "RESULT - Realistic Extended Scheduling Using Light Techniques" with reference DPI2012-36243-C02-01 co-financed by the European Union and FEDER funds and by the Universitat Politecnica de Valencia, for the project MRPIV with reference PAID/2012/202.ElsevierNational Science Foundation, ChinaMinisterio de Economía y CompetitividadUniversitat Politècnica de ValènciaProgram for New Century Excellent Talents in University, ChinaNortheastern University, ChinaRepositorio Institucional de la Universitat Politècnica de València Riunet20142014-04-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/60278reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengMinisterio de Economía y Competitividad http://dx.doi.org/10.13039/501100003329 DPI2012-36243-C02-01 REALISTIC EXTENDED SCHEDULING USING LIGHT TECHNIQUESUniversitat Politècnica de València https://doi.org/10.13039/501100004233 PAID-2012-202National Natural Science Foundation of China https://doi.org/10.13039/501100001809 61174187Program for New Century Excellent Talents in University, China https://doi.org/10.13039/501100004602 NCET-13-0106Northeastern University, China https://doi.org/10.13039/501100004184 29321006Northeastern University, China https://doi.org/10.13039/501100004184 N110208001National Natural Science Foundation of China https://doi.org/10.13039/501100001809 2013020016open accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/602782026-06-13T07:49:27Z
score 15.300724

Similares en LA Referencia