The Non-Permutation Flow-Shop scheduling problem: A literature review

Autores
Rossit, Daniel Alejandro; Tohmé, Fernando Abel; Frutos, Mariano
Año de publicación
2018
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the job order on different machines. The flexibility that NPFS provides in models for industrial applications justifies its use despite its combinatorial complexity. The literature on this problem has expanded largely in the last decade, indicating that the topic is an active research area. This review is a contribution towards the rationalization of the developments in the field, organizing them in terms of the objective functions in the different variants of the problem. A schematic presentation of both theoretical and experimental results summarizes many of the main advances in the study of NPFS. Finally, we include a bibliometric analysis, showing the most promising lines of future development.
Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; Argentina
Fil: Tohmé, Fernando Abel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Economía; Argentina
Fil: Frutos, Mariano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; Argentina
Materia
Flow-Shop
Non-Permutation Flow-Shop
Review
Scheduling
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/62858
Acceder
id CONICETDig_61b5920396a9e415d5c0148deecb7b74
oai_identifier_str oai:ri.conicet.gov.ar:11336/62858
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling The Non-Permutation Flow-Shop scheduling problem: A literature reviewRossit, Daniel AlejandroTohmé, Fernando AbelFrutos, MarianoFlow-ShopNon-Permutation Flow-ShopReviewSchedulingThe Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the job order on different machines. The flexibility that NPFS provides in models for industrial applications justifies its use despite its combinatorial complexity. The literature on this problem has expanded largely in the last decade, indicating that the topic is an active research area. This review is a contribution towards the rationalization of the developments in the field, organizing them in terms of the objective functions in the different variants of the problem. A schematic presentation of both theoretical and experimental results summarizes many of the main advances in the study of NPFS. Finally, we include a bibliometric analysis, showing the most promising lines of future development.Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; ArgentinaFil: Tohmé, Fernando Abel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Economía; ArgentinaFil: Frutos, Mariano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; ArgentinaPergamon-Elsevier Science Ltd2018-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/62858Rossit, Daniel Alejandro; Tohmé, Fernando Abel; Frutos, Mariano; The Non-Permutation Flow-Shop scheduling problem: A literature review; Pergamon-Elsevier Science Ltd; Omega-international Journal Of Management Science; 77; 6-2018; 143-1530305-0483CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0305048316307289info:eu-repo/semantics/altIdentifier/doi/10.1016/j.omega.2017.05.010info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-nd/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-15T14:23:04Zoai:ri.conicet.gov.ar:11336/62858instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-15 14:23:04.369CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv The Non-Permutation Flow-Shop scheduling problem: A literature review
title The Non-Permutation Flow-Shop scheduling problem: A literature review
spellingShingle The Non-Permutation Flow-Shop scheduling problem: A literature review
Rossit, Daniel Alejandro
Flow-Shop
Non-Permutation Flow-Shop
Review
Scheduling
title_short The Non-Permutation Flow-Shop scheduling problem: A literature review
title_full The Non-Permutation Flow-Shop scheduling problem: A literature review
title_fullStr The Non-Permutation Flow-Shop scheduling problem: A literature review
title_full_unstemmed The Non-Permutation Flow-Shop scheduling problem: A literature review
title_sort The Non-Permutation Flow-Shop scheduling problem: A literature review
dc.creator.none.fl_str_mv Rossit, Daniel Alejandro
Tohmé, Fernando Abel
Frutos, Mariano
author Rossit, Daniel Alejandro
author_facet Rossit, Daniel Alejandro
Tohmé, Fernando Abel
Frutos, Mariano
author_role author
author2 Tohmé, Fernando Abel
Frutos, Mariano
author2_role author
author
dc.subject.none.fl_str_mv Flow-Shop
Non-Permutation Flow-Shop
Review
Scheduling
topic Flow-Shop
Non-Permutation Flow-Shop
Review
Scheduling
dc.description.none.fl_txt_mv The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the job order on different machines. The flexibility that NPFS provides in models for industrial applications justifies its use despite its combinatorial complexity. The literature on this problem has expanded largely in the last decade, indicating that the topic is an active research area. This review is a contribution towards the rationalization of the developments in the field, organizing them in terms of the objective functions in the different variants of the problem. A schematic presentation of both theoretical and experimental results summarizes many of the main advances in the study of NPFS. Finally, we include a bibliometric analysis, showing the most promising lines of future development.
Fil: Rossit, Daniel Alejandro. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; Argentina
Fil: Tohmé, Fernando Abel. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Matemática Bahía Blanca. Universidad Nacional del Sur. Departamento de Matemática. Instituto de Matemática Bahía Blanca; Argentina. Universidad Nacional del Sur. Departamento de Economía; Argentina
Fil: Frutos, Mariano. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Bahía Blanca. Instituto de Investigaciones Económicas y Sociales del Sur. Universidad Nacional del Sur. Departamento de Economía. Instituto de Investigaciones Económicas y Sociales del Sur; Argentina. Universidad Nacional del Sur. Departamento de Ingeniería; Argentina
description The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the job order on different machines. The flexibility that NPFS provides in models for industrial applications justifies its use despite its combinatorial complexity. The literature on this problem has expanded largely in the last decade, indicating that the topic is an active research area. This review is a contribution towards the rationalization of the developments in the field, organizing them in terms of the objective functions in the different variants of the problem. A schematic presentation of both theoretical and experimental results summarizes many of the main advances in the study of NPFS. Finally, we include a bibliometric analysis, showing the most promising lines of future development.
publishDate 2018
dc.date.none.fl_str_mv 2018-06
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/62858
Rossit, Daniel Alejandro; Tohmé, Fernando Abel; Frutos, Mariano; The Non-Permutation Flow-Shop scheduling problem: A literature review; Pergamon-Elsevier Science Ltd; Omega-international Journal Of Management Science; 77; 6-2018; 143-153
0305-0483
CONICET Digital
CONICET
url http://hdl.handle.net/11336/62858
identifier_str_mv Rossit, Daniel Alejandro; Tohmé, Fernando Abel; Frutos, Mariano; The Non-Permutation Flow-Shop scheduling problem: A literature review; Pergamon-Elsevier Science Ltd; Omega-international Journal Of Management Science; 77; 6-2018; 143-153
0305-0483
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://www.sciencedirect.com/science/article/pii/S0305048316307289
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.omega.2017.05.010
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-nd/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.publisher.none.fl_str_mv Pergamon-Elsevier Science Ltd
publisher.none.fl_str_mv Pergamon-Elsevier Science Ltd
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846082635143577600
score 13.22299

Publicaciones similares