A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem

As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the assignment of jobs to different factories/workshops...

Descripción completa

Detalles Bibliográficos
Autores: Fernández-Viagas Escudero, Víctor, Framiñán Torres, José Manuel
Tipo de recurso: artículo
Estado:Versión enviada para evaluación y publicación
Fecha de publicación:2014
País:España
Institución:Universidad de Sevilla (US)
Repositorio:idUS. Depósito de Investigación de la Universidad de Sevilla
OAI Identifier:oai:idus.us.es:11441/95331
Acceso en línea:https://hdl.handle.net/11441/95331
https://doi.org/10.1080/00207543.2014.948578
Access Level:acceso abierto
Palabra clave:Distributed permutation flowshop
Iterated greedy algorithm
Scheduling
id ES_e8bef8263cc32b4d422677cd2d038eb2
oai_identifier_str oai:idus.us.es:11441/95331
network_acronym_str ES
network_name_str España
repository_id_str
spelling A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problemFernández-Viagas Escudero, VíctorFramiñán Torres, José ManuelDistributed permutation flowshopIterated greedy algorithmSchedulingAs the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the assignment of jobs to different factories/workshops and their subsequent scheduling. Here we address the so-called distributed permutation flowshop scheduling problem, in which a set of jobs has to be scheduled over a number of identical factories, each one with its machines arranged as a flowshop. Several heuristics have been designed for this problem, although there is no direct comparison among them. In this paper, we propose a new heuristic which exploits the specific structure of the problem. The computational experience carried out on a well-known testbed shows that the proposed heuristic outperforms existing state-of-the-art heuristics, being able to obtain better upper bounds for more than one quarter of the problems in the testbed.Ministerio de Ciencia e Innovación DPI2010-15573/DPITaylor & FrancisOrganización Industrial y Gestión de Empresas I2014info:eu-repo/semantics/articleinfo:eu-repo/semantics/submittedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/95331https://doi.org/10.1080/00207543.2014.948578reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésInternational Journal of Production Research, 53 (4), 1111-1123.DPI2010-15573/DPIhttps://www.tandfonline.com/doi/abs/10.1080/00207543.2014.948578info:eu-repo/semantics/openAccessoai:idus.us.es:11441/953312026-06-17T12:51:07Z
dc.title.none.fl_str_mv A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
title A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
spellingShingle A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
Fernández-Viagas Escudero, Víctor
Distributed permutation flowshop
Iterated greedy algorithm
Scheduling
title_short A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
title_full A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
title_fullStr A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
title_full_unstemmed A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
title_sort A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem
dc.creator.none.fl_str_mv Fernández-Viagas Escudero, Víctor
Framiñán Torres, José Manuel
author Fernández-Viagas Escudero, Víctor
author_facet Fernández-Viagas Escudero, Víctor
Framiñán Torres, José Manuel
author_role author
author2 Framiñán Torres, José Manuel
author2_role author
dc.contributor.none.fl_str_mv Organización Industrial y Gestión de Empresas I
dc.subject.none.fl_str_mv Distributed permutation flowshop
Iterated greedy algorithm
Scheduling
topic Distributed permutation flowshop
Iterated greedy algorithm
Scheduling
description As the interest of practitioners and researchers in scheduling in a multi-factory environment is growing, there is an increasing need to provide efficient algorithms for this type of decision problems, characterised by simultaneously addressing the assignment of jobs to different factories/workshops and their subsequent scheduling. Here we address the so-called distributed permutation flowshop scheduling problem, in which a set of jobs has to be scheduled over a number of identical factories, each one with its machines arranged as a flowshop. Several heuristics have been designed for this problem, although there is no direct comparison among them. In this paper, we propose a new heuristic which exploits the specific structure of the problem. The computational experience carried out on a well-known testbed shows that the proposed heuristic outperforms existing state-of-the-art heuristics, being able to obtain better upper bounds for more than one quarter of the problems in the testbed.
publishDate 2014
dc.date.none.fl_str_mv 2014
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/submittedVersion
format article
status_str submittedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/95331
https://doi.org/10.1080/00207543.2014.948578
url https://hdl.handle.net/11441/95331
https://doi.org/10.1080/00207543.2014.948578
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv International Journal of Production Research, 53 (4), 1111-1123.
DPI2010-15573/DPI
https://www.tandfonline.com/doi/abs/10.1080/00207543.2014.948578
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Taylor & Francis
publisher.none.fl_str_mv Taylor & Francis
dc.source.none.fl_str_mv reponame:idUS. Depósito de Investigación de la Universidad de Sevilla
instname:Universidad de Sevilla (US)
instname_str Universidad de Sevilla (US)
reponame_str idUS. Depósito de Investigación de la Universidad de Sevilla
collection idUS. Depósito de Investigación de la Universidad de Sevilla
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869422968489115648
score 15,300724

Similares en LA Referencia