Critical path analysis for permutation flow shop scheduling problem

Autores
Rossit, Daniel Alejandro; Gupta, Jatinder N. D.; Safe, Martín; Vásquez, Óscar; Tohmé, Fernando Abel; Frutos, Mariano
Año de publicación
2023
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
Scheduling problems in flow shop processes have a great impact on alarge number of applications, both at a production and industrial level,as well as process systems in general (information technologies andbusiness). In all these applications, the most studied objective functionis the makespan, seeking to minimize the total processing time for agiven set of jobs - in its simplest structure (one machine per stage ofthe process, without release date, and no particular conditions for jobprocessing), an NP-Hard problem for 3 machines or more. Within theway of approaching the problem according to the solution category,permutation solutions are the most widely used; in them, the same order of jobs is respected in all process stages. In the literature, thereare a large number of approaches and methods proposed to address theoptimization of the makespan for this problem. This paper proposes tostudy the structure of the solutions from the perspective of the structureof its critical path, considering as a critical path the set of operationssupporting the makespan. In this approach, some results from the literature will be used to extend the solutions to other cases. In turn, thepotential impacts of considering the solution structure for the design ofsolving methods will be presented and discussed.
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: Gupta, Jatinder N. D.. University Of Alabama In Huntsville; Estados Unidos
Fil: Safe, Martín. 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
Fil: Vásquez, Óscar. Universidad de Santiago de Chile; Chile
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
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
23rd International Conference of the International Federation of Operational Research Societies
Santiago
Chile
Instituto Chileno de Investigación Operativa
Materia
SHEDULING
MAKESPAN
CRITICAL PATH
FLOW SHOP
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/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/243413
Acceder
id CONICETDig_08bf8ec116820c8c501b185aac7f6d44
oai_identifier_str oai:ri.conicet.gov.ar:11336/243413
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Critical path analysis for permutation flow shop scheduling problemRossit, Daniel AlejandroGupta, Jatinder N. D.Safe, MartínVásquez, ÓscarTohmé, Fernando AbelFrutos, MarianoSHEDULINGMAKESPANCRITICAL PATHFLOW SHOPhttps://purl.org/becyt/ford/2.11https://purl.org/becyt/ford/2Scheduling problems in flow shop processes have a great impact on alarge number of applications, both at a production and industrial level,as well as process systems in general (information technologies andbusiness). In all these applications, the most studied objective functionis the makespan, seeking to minimize the total processing time for agiven set of jobs - in its simplest structure (one machine per stage ofthe process, without release date, and no particular conditions for jobprocessing), an NP-Hard problem for 3 machines or more. Within theway of approaching the problem according to the solution category,permutation solutions are the most widely used; in them, the same order of jobs is respected in all process stages. In the literature, thereare a large number of approaches and methods proposed to address theoptimization of the makespan for this problem. This paper proposes tostudy the structure of the solutions from the perspective of the structureof its critical path, considering as a critical path the set of operationssupporting the makespan. In this approach, some results from the literature will be used to extend the solutions to other cases. In turn, thepotential impacts of considering the solution structure for the design ofsolving methods will be presented and discussed.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: Gupta, Jatinder N. D.. University Of Alabama In Huntsville; Estados UnidosFil: Safe, Martín. 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; ArgentinaFil: Vásquez, Óscar. Universidad de Santiago de Chile; ChileFil: 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; 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; Argentina23rd International Conference of the International Federation of Operational Research SocietiesSantiagoChileInstituto Chileno de Investigación OperativaInstituto Chileno de Investigación Operativa (ICHIO)2023info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectCongresoBookhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/243413Critical path analysis for permutation flow shop scheduling problem; 23rd International Conference of the International Federation of Operational Research Societies; Santiago; Chile; 2023; 146978-956-416-407-6CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://www.ifors.org/wp-content/uploads/2023/11/IFORS-Proceedings-2023.pdfInternacionalinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-09-29T10:31:50Zoai:ri.conicet.gov.ar:11336/243413instacron: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-09-29 10:31:51.236CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Critical path analysis for permutation flow shop scheduling problem
title Critical path analysis for permutation flow shop scheduling problem
spellingShingle Critical path analysis for permutation flow shop scheduling problem
Rossit, Daniel Alejandro
SHEDULING
MAKESPAN
CRITICAL PATH
FLOW SHOP
title_short Critical path analysis for permutation flow shop scheduling problem
title_full Critical path analysis for permutation flow shop scheduling problem
title_fullStr Critical path analysis for permutation flow shop scheduling problem
title_full_unstemmed Critical path analysis for permutation flow shop scheduling problem
title_sort Critical path analysis for permutation flow shop scheduling problem
dc.creator.none.fl_str_mv Rossit, Daniel Alejandro
Gupta, Jatinder N. D.
Safe, Martín
Vásquez, Óscar
Tohmé, Fernando Abel
Frutos, Mariano
author Rossit, Daniel Alejandro
author_facet Rossit, Daniel Alejandro
Gupta, Jatinder N. D.
Safe, Martín
Vásquez, Óscar
Tohmé, Fernando Abel
Frutos, Mariano
author_role author
author2 Gupta, Jatinder N. D.
Safe, Martín
Vásquez, Óscar
Tohmé, Fernando Abel
Frutos, Mariano
author2_role author
author
author
author
author
dc.subject.none.fl_str_mv SHEDULING
MAKESPAN
CRITICAL PATH
FLOW SHOP
topic SHEDULING
MAKESPAN
CRITICAL PATH
FLOW SHOP
purl_subject.fl_str_mv https://purl.org/becyt/ford/2.11
https://purl.org/becyt/ford/2
dc.description.none.fl_txt_mv Scheduling problems in flow shop processes have a great impact on alarge number of applications, both at a production and industrial level,as well as process systems in general (information technologies andbusiness). In all these applications, the most studied objective functionis the makespan, seeking to minimize the total processing time for agiven set of jobs - in its simplest structure (one machine per stage ofthe process, without release date, and no particular conditions for jobprocessing), an NP-Hard problem for 3 machines or more. Within theway of approaching the problem according to the solution category,permutation solutions are the most widely used; in them, the same order of jobs is respected in all process stages. In the literature, thereare a large number of approaches and methods proposed to address theoptimization of the makespan for this problem. This paper proposes tostudy the structure of the solutions from the perspective of the structureof its critical path, considering as a critical path the set of operationssupporting the makespan. In this approach, some results from the literature will be used to extend the solutions to other cases. In turn, thepotential impacts of considering the solution structure for the design ofsolving methods will be presented and discussed.
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: Gupta, Jatinder N. D.. University Of Alabama In Huntsville; Estados Unidos
Fil: Safe, Martín. 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
Fil: Vásquez, Óscar. Universidad de Santiago de Chile; Chile
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
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
23rd International Conference of the International Federation of Operational Research Societies
Santiago
Chile
Instituto Chileno de Investigación Operativa
description Scheduling problems in flow shop processes have a great impact on alarge number of applications, both at a production and industrial level,as well as process systems in general (information technologies andbusiness). In all these applications, the most studied objective functionis the makespan, seeking to minimize the total processing time for agiven set of jobs - in its simplest structure (one machine per stage ofthe process, without release date, and no particular conditions for jobprocessing), an NP-Hard problem for 3 machines or more. Within theway of approaching the problem according to the solution category,permutation solutions are the most widely used; in them, the same order of jobs is respected in all process stages. In the literature, thereare a large number of approaches and methods proposed to address theoptimization of the makespan for this problem. This paper proposes tostudy the structure of the solutions from the perspective of the structureof its critical path, considering as a critical path the set of operationssupporting the makespan. In this approach, some results from the literature will be used to extend the solutions to other cases. In turn, thepotential impacts of considering the solution structure for the design ofsolving methods will be presented and discussed.
publishDate 2023
dc.date.none.fl_str_mv 2023
dc.type.none.fl_str_mv info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/conferenceObject
Congreso
Book
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
status_str publishedVersion
format conferenceObject
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/243413
Critical path analysis for permutation flow shop scheduling problem; 23rd International Conference of the International Federation of Operational Research Societies; Santiago; Chile; 2023; 146
978-956-416-407-6
CONICET Digital
CONICET
url http://hdl.handle.net/11336/243413
identifier_str_mv Critical path analysis for permutation flow shop scheduling problem; 23rd International Conference of the International Federation of Operational Research Societies; Santiago; Chile; 2023; 146
978-956-416-407-6
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.ifors.org/wp-content/uploads/2023/11/IFORS-Proceedings-2023.pdf
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.coverage.none.fl_str_mv Internacional
dc.publisher.none.fl_str_mv Instituto Chileno de Investigación Operativa (ICHIO)
publisher.none.fl_str_mv Instituto Chileno de Investigación Operativa (ICHIO)
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_ 1844614330701578240
score 13.070432

Publicaciones similares