The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic

In this paper, we address the 2-stage assembly scheduling problem where there are m machines in the first stage to manufacture the components of a product and one assembly station (machine) in the second stage. The objective considered is the minimisation of the total completion time. Since the NP-h...

Descripción completa

Detalles Bibliográficos
Autores: Framiñán Torres, José Manuel, Pérez González, Paz
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2017
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/96664
Acceso en línea:https://hdl.handle.net/11441/96664
https://doi.org/10.1016/j.cor.2017.07.012
Access Level:acceso abierto
Palabra clave:Scheduling Assembly
Completion time
Heuristics
id ES_c83e51590ff02e90bf4b14d56aaabf2d
oai_identifier_str oai:idus.us.es:11441/96664
network_acronym_str ES
network_name_str España
repository_id_str
spelling The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristicFramiñán Torres, José ManuelPérez González, PazScheduling AssemblyCompletion timeHeuristicsIn this paper, we address the 2-stage assembly scheduling problem where there are m machines in the first stage to manufacture the components of a product and one assembly station (machine) in the second stage. The objective considered is the minimisation of the total completion time. Since the NP-hard nature of this problem is well-established, most previous research has focused on finding approximate solutions in reasonable computation time. In our paper, we first review and derive a number of problem properties and, based on these ideas, we develop a constructive heuristic that outperforms the existing constructive heuristics for the problem, providing solutions almost in real-time. Finally, for the cases where extremely high-quality solutions are required, a variable local search algorithm is proposed. The computational experience carried out shows that the algorithm outperforms the best existing metaheuristic for the problem. As a summary, the heuristics presented in the paper substantially modify the state-of-the-art of the approximate methods for the 2-stage assembly scheduling problem with total completion time objective.ElsevierOrganización Industrial y Gestión de Empresas ITEP134: Organización IndustrialMinisterio de Ciencia, Innovación y Universidades (MICINN). España2017info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfapplication/pdfhttps://hdl.handle.net/11441/96664https://doi.org/10.1016/j.cor.2017.07.012reponame:idUS. Depósito de Investigación de la Universidad de Sevillainstname:Universidad de Sevilla (US)InglésComputers & Operations Research, 88, 237-246.DPI2016-80750-PDPI2013-44461-Phttps://www--sciencedirect--com.us.debiblio.com/science/article/pii/S030505481730196Xinfo:eu-repo/semantics/openAccessoai:idus.us.es:11441/966642026-06-17T12:51:07Z
dc.title.none.fl_str_mv The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
title The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
spellingShingle The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
Framiñán Torres, José Manuel
Scheduling Assembly
Completion time
Heuristics
title_short The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
title_full The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
title_fullStr The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
title_full_unstemmed The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
title_sort The 2-stage assembly flowshop scheduling problem with total completion time: Efficient constructive heuristic and metaheuristic
dc.creator.none.fl_str_mv Framiñán Torres, José Manuel
Pérez González, Paz
author Framiñán Torres, José Manuel
author_facet Framiñán Torres, José Manuel
Pérez González, Paz
author_role author
author2 Pérez González, Paz
author2_role author
dc.contributor.none.fl_str_mv Organización Industrial y Gestión de Empresas I
TEP134: Organización Industrial
Ministerio de Ciencia, Innovación y Universidades (MICINN). España
dc.subject.none.fl_str_mv Scheduling Assembly
Completion time
Heuristics
topic Scheduling Assembly
Completion time
Heuristics
description In this paper, we address the 2-stage assembly scheduling problem where there are m machines in the first stage to manufacture the components of a product and one assembly station (machine) in the second stage. The objective considered is the minimisation of the total completion time. Since the NP-hard nature of this problem is well-established, most previous research has focused on finding approximate solutions in reasonable computation time. In our paper, we first review and derive a number of problem properties and, based on these ideas, we develop a constructive heuristic that outperforms the existing constructive heuristics for the problem, providing solutions almost in real-time. Finally, for the cases where extremely high-quality solutions are required, a variable local search algorithm is proposed. The computational experience carried out shows that the algorithm outperforms the best existing metaheuristic for the problem. As a summary, the heuristics presented in the paper substantially modify the state-of-the-art of the approximate methods for the 2-stage assembly scheduling problem with total completion time objective.
publishDate 2017
dc.date.none.fl_str_mv 2017
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv https://hdl.handle.net/11441/96664
https://doi.org/10.1016/j.cor.2017.07.012
url https://hdl.handle.net/11441/96664
https://doi.org/10.1016/j.cor.2017.07.012
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Computers & Operations Research, 88, 237-246.
DPI2016-80750-P
DPI2013-44461-P
https://www--sciencedirect--com.us.debiblio.com/science/article/pii/S030505481730196X
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 Elsevier
publisher.none.fl_str_mv Elsevier
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_ 1869419269068947456
score 15,301603

Similares en LA Referencia