An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems

Autores
Basán, Natalia P.; Cóccola, Mariana E.; Méndez, Carlos A.
Año de publicación
2019
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
This paper presents a MILP-based decomposition algorithm for solving large-scale scheduling problems with assembly operations in flexible flow shop environments. First, a rigorous mixed-integer linear (MILP) formulation based on the general precedence notion is developed for the problem under study. Then, the MILP model is embedded within a decomposition algorithm in order to accelerate the resolution of large-size industrial problems. The proposed solution approach is tested on several examples derived from a real-world case study arising in a shipbuilding company.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Flexible flow shop
Scheduling problem
Assembly operations
MILP model
Decomposition strategy
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-sa/3.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/89504

id SEDICI_088f3814488d9cc9c0cc8a38d770707b
oai_identifier_str oai:sedici.unlp.edu.ar:10915/89504
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling ProblemsBasán, Natalia P.Cóccola, Mariana E.Méndez, Carlos A.Ciencias InformáticasFlexible flow shopScheduling problemAssembly operationsMILP modelDecomposition strategyThis paper presents a MILP-based decomposition algorithm for solving large-scale scheduling problems with assembly operations in flexible flow shop environments. First, a rigorous mixed-integer linear (MILP) formulation based on the general precedence notion is developed for the problem under study. Then, the MILP model is embedded within a decomposition algorithm in order to accelerate the resolution of large-size industrial problems. The proposed solution approach is tested on several examples derived from a real-world case study arising in a shipbuilding company.Sociedad Argentina de Informática e Investigación Operativa2019-09info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf64-75http://sedici.unlp.edu.ar/handle/10915/89504enginfo:eu-repo/semantics/altIdentifier/issn/2618-3277info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-sa/3.0/Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-10-15T11:10:17Zoai:sedici.unlp.edu.ar:10915/89504Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 11:10:17.352SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
title An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
spellingShingle An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
Basán, Natalia P.
Ciencias Informáticas
Flexible flow shop
Scheduling problem
Assembly operations
MILP model
Decomposition strategy
title_short An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
title_full An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
title_fullStr An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
title_full_unstemmed An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
title_sort An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
dc.creator.none.fl_str_mv Basán, Natalia P.
Cóccola, Mariana E.
Méndez, Carlos A.
author Basán, Natalia P.
author_facet Basán, Natalia P.
Cóccola, Mariana E.
Méndez, Carlos A.
author_role author
author2 Cóccola, Mariana E.
Méndez, Carlos A.
author2_role author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Flexible flow shop
Scheduling problem
Assembly operations
MILP model
Decomposition strategy
topic Ciencias Informáticas
Flexible flow shop
Scheduling problem
Assembly operations
MILP model
Decomposition strategy
dc.description.none.fl_txt_mv This paper presents a MILP-based decomposition algorithm for solving large-scale scheduling problems with assembly operations in flexible flow shop environments. First, a rigorous mixed-integer linear (MILP) formulation based on the general precedence notion is developed for the problem under study. Then, the MILP model is embedded within a decomposition algorithm in order to accelerate the resolution of large-size industrial problems. The proposed solution approach is tested on several examples derived from a real-world case study arising in a shipbuilding company.
Sociedad Argentina de Informática e Investigación Operativa
description This paper presents a MILP-based decomposition algorithm for solving large-scale scheduling problems with assembly operations in flexible flow shop environments. First, a rigorous mixed-integer linear (MILP) formulation based on the general precedence notion is developed for the problem under study. Then, the MILP model is embedded within a decomposition algorithm in order to accelerate the resolution of large-size industrial problems. The proposed solution approach is tested on several examples derived from a real-world case study arising in a shipbuilding company.
publishDate 2019
dc.date.none.fl_str_mv 2019-09
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/89504
url http://sedici.unlp.edu.ar/handle/10915/89504
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/2618-3277
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-sa/3.0/
Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-sa/3.0/
Creative Commons Attribution-ShareAlike 3.0 Unported (CC BY-SA 3.0)
dc.format.none.fl_str_mv application/pdf
64-75
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1846064159672762368
score 12.8982525