A scatter search algorithm for the distributed permutation flowshop scheduling problem

The distributed permutation flowshop problem has been recently proposed as a generalization of the regular flowshop setting where more than one factory is available to process jobs. Distributed manufacturing is a common situation for large enterprises that compete in a globalized market. The problem...

Descripción completa

Detalles Bibliográficos
Autores: Naderi, Bahman, 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/60188
Acceso en línea:https://riunet.upv.es/handle/10251/60188
Access Level:acceso abierto
Palabra clave:Distributed scheduling
Permutation flow shop
Scatter search
ESTADISTICA E INVESTIGACION OPERATIVA
id ES_c14e50bc2bdbb09c849a2e03440a5058
oai_identifier_str oai:riunet.upv.es:10251/60188
network_acronym_str ES
network_name_str España
repository_id_str
spelling A scatter search algorithm for the distributed permutation flowshop scheduling problemNaderi, BahmanRuiz García, RubénDistributed schedulingPermutation flow shopScatter searchESTADISTICA E INVESTIGACION OPERATIVAThe distributed permutation flowshop problem has been recently proposed as a generalization of the regular flowshop setting where more than one factory is available to process jobs. Distributed manufacturing is a common situation for large enterprises that compete in a globalized market. The problem has two dimensions: assigning jobs to factories and scheduling the jobs assigned to each factory. Despite being recently introduced, this interesting scheduling problem has attracted attention and several heuristic and metaheuristic methods have been proposed in the literature. In this paper we present a scatter search (SS) method for this problem to optimize makespan. SS has seldom been explored for flowshop settings. In the proposed algorithm we employ some advanced techniques like a reference set made up of complete and partial solutions along with other features like restarts and local search. A comprehensive computational campaign including 10 existing algorithms, together with statistical analyses, shows that the proposed scatter search algorithm produces better results than existing algorithms by a significant margin. Moreover all 720 known best solutions for this problem are improved.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.ElsevierUniversitat Politècnica de ValènciaMinisterio de Economía y CompetitividadRepositorio Institucional de la Universitat Politècnica de València Riunet20142014-12-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/60188reponame: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%2F2012%2F202open 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/601882026-06-13T07:49:27Z
dc.title.none.fl_str_mv A scatter search algorithm for the distributed permutation flowshop scheduling problem
title A scatter search algorithm for the distributed permutation flowshop scheduling problem
spellingShingle A scatter search algorithm for the distributed permutation flowshop scheduling problem
Naderi, Bahman
Distributed scheduling
Permutation flow shop
Scatter search
ESTADISTICA E INVESTIGACION OPERATIVA
title_short A scatter search algorithm for the distributed permutation flowshop scheduling problem
title_full A scatter search algorithm for the distributed permutation flowshop scheduling problem
title_fullStr A scatter search algorithm for the distributed permutation flowshop scheduling problem
title_full_unstemmed A scatter search algorithm for the distributed permutation flowshop scheduling problem
title_sort A scatter search algorithm for the distributed permutation flowshop scheduling problem
dc.creator.none.fl_str_mv Naderi, Bahman
Ruiz García, Rubén
author Naderi, Bahman
author_facet Naderi, Bahman
Ruiz García, Rubén
author_role author
author2 Ruiz García, Rubén
author2_role author
dc.contributor.none.fl_str_mv Universitat Politècnica de València
Ministerio de Economía y Competitividad
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Distributed scheduling
Permutation flow shop
Scatter search
ESTADISTICA E INVESTIGACION OPERATIVA
topic Distributed scheduling
Permutation flow shop
Scatter search
ESTADISTICA E INVESTIGACION OPERATIVA
description The distributed permutation flowshop problem has been recently proposed as a generalization of the regular flowshop setting where more than one factory is available to process jobs. Distributed manufacturing is a common situation for large enterprises that compete in a globalized market. The problem has two dimensions: assigning jobs to factories and scheduling the jobs assigned to each factory. Despite being recently introduced, this interesting scheduling problem has attracted attention and several heuristic and metaheuristic methods have been proposed in the literature. In this paper we present a scatter search (SS) method for this problem to optimize makespan. SS has seldom been explored for flowshop settings. In the proposed algorithm we employ some advanced techniques like a reference set made up of complete and partial solutions along with other features like restarts and local search. A comprehensive computational campaign including 10 existing algorithms, together with statistical analyses, shows that the proposed scatter search algorithm produces better results than existing algorithms by a significant margin. Moreover all 720 known best solutions for this problem are improved.
publishDate 2014
dc.date.none.fl_str_mv 2014
2014-12-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/60188
url https://riunet.upv.es/handle/10251/60188
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%2F2012%2F202
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_ 1869418549476327424
score 15.198674

Similares en LA Referencia