An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants

Autores
Basán, Natalia Paola; Coccola, Mariana Evangelina; del Valle, Alejandro García; Mendez, Carlos Alberto
Año de publicación
2019
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
This paper presents a decomposition algorithm for the integrated scheduling and redesign problem of a multistage batch plant dealing with multipurpose units and heterogeneous recipes. First, the procedure solves the scheduling problem considering the existing plant configuration with the main goal of minimizing the makespan. Then, a second objective of minimizing the number of units utilized without worsen the makespan achieved in the first stage is considered. The units released can be reallocated to other compatible processing stages in order to minimize the initial makespan value. In order to tackle large industrial examples, both scheduling and redesign problems are solved through a decomposition algorithm, which has a MILP model as its core. The procedure is tested on several realistic instances, demonstrating its robustness and applicability.
Fil: Basán, Natalia Paola. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: Coccola, Mariana Evangelina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: del Valle, Alejandro García. Universidad da Coruña; España
Fil: Mendez, Carlos Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Materia
SCHEDULING
PLANNING
MILP MODEL
REDESIGN
FLEXIBLE JOB 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/107894
Acceder
id CONICETDig_2abc0e769973dc842ead331de6f5256f
oai_identifier_str oai:ri.conicet.gov.ar:11336/107894
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plantsBasán, Natalia PaolaCoccola, Mariana Evangelinadel Valle, Alejandro GarcíaMendez, Carlos AlbertoSCHEDULINGPLANNINGMILP MODELREDESIGNFLEXIBLE JOB SHOPhttps://purl.org/becyt/ford/2.11https://purl.org/becyt/ford/2This paper presents a decomposition algorithm for the integrated scheduling and redesign problem of a multistage batch plant dealing with multipurpose units and heterogeneous recipes. First, the procedure solves the scheduling problem considering the existing plant configuration with the main goal of minimizing the makespan. Then, a second objective of minimizing the number of units utilized without worsen the makespan achieved in the first stage is considered. The units released can be reallocated to other compatible processing stages in order to minimize the initial makespan value. In order to tackle large industrial examples, both scheduling and redesign problems are solved through a decomposition algorithm, which has a MILP model as its core. The procedure is tested on several realistic instances, demonstrating its robustness and applicability.Fil: Basán, Natalia Paola. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaFil: Coccola, Mariana Evangelina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaFil: del Valle, Alejandro García. Universidad da Coruña; EspañaFil: Mendez, Carlos Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; ArgentinaItalian Association of Chemical Engineering2019-06info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/107894Basán, Natalia Paola; Coccola, Mariana Evangelina; del Valle, Alejandro García; Mendez, Carlos Alberto; An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants; Italian Association of Chemical Engineering ; Chemical Engineering Transactions; 74; 6-2019; 613-6182283-9216CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/doi/10.3303/CET1974103info: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-03T10:03:27Zoai:ri.conicet.gov.ar:11336/107894instacron: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-03 10:03:27.806CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
title An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
spellingShingle An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
Basán, Natalia Paola
SCHEDULING
PLANNING
MILP MODEL
REDESIGN
FLEXIBLE JOB SHOP
title_short An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
title_full An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
title_fullStr An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
title_full_unstemmed An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
title_sort An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants
dc.creator.none.fl_str_mv Basán, Natalia Paola
Coccola, Mariana Evangelina
del Valle, Alejandro García
Mendez, Carlos Alberto
author Basán, Natalia Paola
author_facet Basán, Natalia Paola
Coccola, Mariana Evangelina
del Valle, Alejandro García
Mendez, Carlos Alberto
author_role author
author2 Coccola, Mariana Evangelina
del Valle, Alejandro García
Mendez, Carlos Alberto
author2_role author
author
author
dc.subject.none.fl_str_mv SCHEDULING
PLANNING
MILP MODEL
REDESIGN
FLEXIBLE JOB SHOP
topic SCHEDULING
PLANNING
MILP MODEL
REDESIGN
FLEXIBLE JOB 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 This paper presents a decomposition algorithm for the integrated scheduling and redesign problem of a multistage batch plant dealing with multipurpose units and heterogeneous recipes. First, the procedure solves the scheduling problem considering the existing plant configuration with the main goal of minimizing the makespan. Then, a second objective of minimizing the number of units utilized without worsen the makespan achieved in the first stage is considered. The units released can be reallocated to other compatible processing stages in order to minimize the initial makespan value. In order to tackle large industrial examples, both scheduling and redesign problems are solved through a decomposition algorithm, which has a MILP model as its core. The procedure is tested on several realistic instances, demonstrating its robustness and applicability.
Fil: Basán, Natalia Paola. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: Coccola, Mariana Evangelina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
Fil: del Valle, Alejandro García. Universidad da Coruña; España
Fil: Mendez, Carlos Alberto. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - Santa Fe. Instituto de Desarrollo Tecnológico para la Industria Química. Universidad Nacional del Litoral. Instituto de Desarrollo Tecnológico para la Industria Química; Argentina
description This paper presents a decomposition algorithm for the integrated scheduling and redesign problem of a multistage batch plant dealing with multipurpose units and heterogeneous recipes. First, the procedure solves the scheduling problem considering the existing plant configuration with the main goal of minimizing the makespan. Then, a second objective of minimizing the number of units utilized without worsen the makespan achieved in the first stage is considered. The units released can be reallocated to other compatible processing stages in order to minimize the initial makespan value. In order to tackle large industrial examples, both scheduling and redesign problems are solved through a decomposition algorithm, which has a MILP model as its core. The procedure is tested on several realistic instances, demonstrating its robustness and applicability.
publishDate 2019
dc.date.none.fl_str_mv 2019-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/107894
Basán, Natalia Paola; Coccola, Mariana Evangelina; del Valle, Alejandro García; Mendez, Carlos Alberto; An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants; Italian Association of Chemical Engineering ; Chemical Engineering Transactions; 74; 6-2019; 613-618
2283-9216
CONICET Digital
CONICET
url http://hdl.handle.net/11336/107894
identifier_str_mv Basán, Natalia Paola; Coccola, Mariana Evangelina; del Valle, Alejandro García; Mendez, Carlos Alberto; An effective MILP-based decomposition algorithm for the scheduling and redesign of flexible job-shop plants; Italian Association of Chemical Engineering ; Chemical Engineering Transactions; 74; 6-2019; 613-618
2283-9216
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/doi/10.3303/CET1974103
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
dc.publisher.none.fl_str_mv Italian Association of Chemical Engineering
publisher.none.fl_str_mv Italian Association of Chemical Engineering
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_ 1842269801349644288
score 13.13397

Publicaciones similares