- -

A scatter search algorithm for the distributed permutation flowshop scheduling problem

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

A scatter search algorithm for the distributed permutation flowshop scheduling problem

Show simple item record

Files in this item

dc.contributor.author Naderi, Bahman es_ES
dc.contributor.author Ruiz García, Rubén es_ES
dc.date.accessioned 2016-01-26T14:48:40Z
dc.date.available 2016-01-26T14:48:40Z
dc.date.issued 2014-12-01
dc.identifier.issn 0377-2217
dc.identifier.uri http://hdl.handle.net/10251/60188
dc.description.abstract 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. es_ES
dc.description.sponsorship 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. en_EN
dc.language Inglés es_ES
dc.publisher Elsevier es_ES
dc.relation.ispartof European Journal of Operational Research es_ES
dc.rights Reserva de todos los derechos es_ES
dc.subject Distributed scheduling es_ES
dc.subject Permutation flowshop es_ES
dc.subject Scatter search es_ES
dc.subject.classification ESTADISTICA E INVESTIGACION OPERATIVA es_ES
dc.title A scatter search algorithm for the distributed permutation flowshop scheduling problem es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1016/j.ejor.2014.05.024
dc.relation.projectID info:eu-repo/grantAgreement/MINECO//DPI2012-36243-C02-01/ES/REALISTIC EXTENDED SCHEDULING USING LIGHT TECHNIQUES/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/UPV//PAID%2F2012%2F202/ es_ES
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Estadística e Investigación Operativa Aplicadas y Calidad - Departament d'Estadística i Investigació Operativa Aplicades i Qualitat es_ES
dc.description.bibliographicCitation Naderi, B.; Ruiz García, R. (2014). A scatter search algorithm for the distributed permutation flowshop scheduling problem. European Journal of Operational Research. 239(2):323-334. https://doi.org/10.1016/j.ejor.2014.05.024 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1016/j.ejor.2014.05.024 es_ES
dc.description.upvformatpinicio 323 es_ES
dc.description.upvformatpfin 334 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 239 es_ES
dc.description.issue 2 es_ES
dc.relation.senia 280780 es_ES
dc.contributor.funder Universitat Politècnica de València es_ES
dc.contributor.funder Ministerio de Economía y Competitividad es_ES


This item appears in the following Collection(s)

Show simple item record