Benders decomposition for the mixed no-idle permutation flowshop scheduling problem

[EN] The mixed no-idle flowshop scheduling problem arises in modern industries including integrated circuits, ceramic frit and steel production, among others, and where some machines are not allowed to remain idle between jobs. This paper describes an exact algorithm that uses Benders decomposition...

Descripción completa

Detalles Bibliográficos
Autores: Bektas, Tolga, Hamzadayi, Alper, Ruiz García, Rubén
Tipo de recurso: artículo
Fecha de publicación:2020
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/170778
Acceso en línea:https://riunet.upv.es/handle/10251/170778
Access Level:acceso abierto
Palabra clave:Flowshop scheduling
Mixed no-idle
Benders decomposition
Referenced local search
ESTADISTICA E INVESTIGACION OPERATIVA
id ES_eb6e754df053baa76cd0832b92f7c111
oai_identifier_str oai:riunet.upv.es:10251/170778
network_acronym_str ES
network_name_str España
repository_id_str
spelling Benders decomposition for the mixed no-idle permutation flowshop scheduling problemBektas, TolgaHamzadayi, AlperRuiz García, RubénFlowshop schedulingMixed no-idleBenders decompositionReferenced local searchESTADISTICA E INVESTIGACION OPERATIVA[EN] The mixed no-idle flowshop scheduling problem arises in modern industries including integrated circuits, ceramic frit and steel production, among others, and where some machines are not allowed to remain idle between jobs. This paper describes an exact algorithm that uses Benders decomposition with a simple yet effective enhancement mechanism that entails the generation of additional cuts by using a referenced local search to help speed up convergence. Using only a single additional optimality cut at each iteration, and combined with combinatorial cuts, the algorithm can optimally solve instances with up to 500 jobs and 15 machines that are otherwise not within the reach of off-the-shelf optimization software, and can easily surpass ad-hoc existing metaheuristics. To the best of the authors' knowledge, the algorithm described here is the only exact method for solving the mixed no-idle permutation flowshop scheduling problem.This research project was partially supported by the Scientific and Technological Research Council of Turkey (TuBITAK) under Grant 1059B191600107. While writing this paper, Dr Hamzaday was a visiting researcher at the Southampton Business School at the University of Southampton. Ruben Ruiz is supported by the Spanish Ministry of Science, Innovation and Universities, under the Project 'OPTEP-Port Terminal Operations Optimization' (No. RTI2018-094940-B-I00) financed with FEDER funds. Thanks are due to two anonymous reviewers for their careful reading of the paper and helpful suggestions.Springer-VerlagAgencia Estatal de InvestigaciónEuropean Regional Development FundScientific and Technological Research Council of TurkeyRepositorio Institucional de la Universitat Politècnica de València Riunet20202020-08-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfhttps://riunet.upv.es/handle/10251/170778reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengScientific and Technological Research Council of Turkey https://doi.org/10.13039/501100004410 1059B191600107Agencia Estatal de Investigación http://dx.doi.org/10.13039/501100011033 Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020 RTI2018-094940-B-I00 OPTIMIZACION DE OPERACIONES EN TERMINALES PORTUARIASopen accesshttp://purl.org/coar/access_right/c_abf2Reconocimiento (by)http://creativecommons.org/licenses/by/4.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/1707782026-06-13T07:49:27Z
dc.title.none.fl_str_mv Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
title Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
spellingShingle Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
Bektas, Tolga
Flowshop scheduling
Mixed no-idle
Benders decomposition
Referenced local search
ESTADISTICA E INVESTIGACION OPERATIVA
title_short Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
title_full Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
title_fullStr Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
title_full_unstemmed Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
title_sort Benders decomposition for the mixed no-idle permutation flowshop scheduling problem
dc.creator.none.fl_str_mv Bektas, Tolga
Hamzadayi, Alper
Ruiz García, Rubén
author Bektas, Tolga
author_facet Bektas, Tolga
Hamzadayi, Alper
Ruiz García, Rubén
author_role author
author2 Hamzadayi, Alper
Ruiz García, Rubén
author2_role author
author
dc.contributor.none.fl_str_mv Agencia Estatal de Investigación
European Regional Development Fund
Scientific and Technological Research Council of Turkey
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Flowshop scheduling
Mixed no-idle
Benders decomposition
Referenced local search
ESTADISTICA E INVESTIGACION OPERATIVA
topic Flowshop scheduling
Mixed no-idle
Benders decomposition
Referenced local search
ESTADISTICA E INVESTIGACION OPERATIVA
description [EN] The mixed no-idle flowshop scheduling problem arises in modern industries including integrated circuits, ceramic frit and steel production, among others, and where some machines are not allowed to remain idle between jobs. This paper describes an exact algorithm that uses Benders decomposition with a simple yet effective enhancement mechanism that entails the generation of additional cuts by using a referenced local search to help speed up convergence. Using only a single additional optimality cut at each iteration, and combined with combinatorial cuts, the algorithm can optimally solve instances with up to 500 jobs and 15 machines that are otherwise not within the reach of off-the-shelf optimization software, and can easily surpass ad-hoc existing metaheuristics. To the best of the authors' knowledge, the algorithm described here is the only exact method for solving the mixed no-idle permutation flowshop scheduling problem.
publishDate 2020
dc.date.none.fl_str_mv 2020
2020-08-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/170778
url https://riunet.upv.es/handle/10251/170778
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv Scientific and Technological Research Council of Turkey https://doi.org/10.13039/501100004410 1059B191600107
Agencia Estatal de Investigación http://dx.doi.org/10.13039/501100011033 Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020 RTI2018-094940-B-I00 OPTIMIZACION DE OPERACIONES EN TERMINALES PORTUARIAS
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reconocimiento (by)
http://creativecommons.org/licenses/by/4.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
Reconocimiento (by)
http://creativecommons.org/licenses/by/4.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Springer-Verlag
publisher.none.fl_str_mv Springer-Verlag
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_ 1869423227007139840
score 15,301603

Similares en LA Referencia