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

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....

Descripción completa

Detalles Bibliográficos
Autores principales: Basán, Natalia P., Cóccola, Mariana E., Méndez, Carlos A.
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2019
Materias:
Ciencias Informáticas
Flexible flow shop
Scheduling problem
Assembly operations
MILP model
Decomposition strategy
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/89504
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-89504
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Flexible flow shop
Scheduling problem
Assembly operations
MILP model
Decomposition strategy
spellingShingle Ciencias Informáticas
Flexible flow shop
Scheduling problem
Assembly operations
MILP model
Decomposition strategy
Basán, Natalia P.
Cóccola, Mariana E.
Méndez, Carlos A.
An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
topic_facet Ciencias Informáticas
Flexible flow shop
Scheduling problem
Assembly operations
MILP model
Decomposition strategy
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.
format Objeto de conferencia
Objeto de conferencia
author Basán, Natalia P.
Cóccola, Mariana E.
Méndez, Carlos A.
author_facet Basán, Natalia P.
Cóccola, Mariana E.
Méndez, Carlos A.
author_sort Basán, Natalia P.
title An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
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 efficient milp-based decomposition strategy for solving large-scale scheduling problems
publishDate 2019
url http://sedici.unlp.edu.ar/handle/10915/89504
work_keys_str_mv AT basannataliap anefficientmilpbaseddecompositionstrategyforsolvinglargescaleschedulingproblems
AT coccolamarianae anefficientmilpbaseddecompositionstrategyforsolvinglargescaleschedulingproblems
AT mendezcarlosa anefficientmilpbaseddecompositionstrategyforsolvinglargescaleschedulingproblems
AT basannataliap efficientmilpbaseddecompositionstrategyforsolvinglargescaleschedulingproblems
AT coccolamarianae efficientmilpbaseddecompositionstrategyforsolvinglargescaleschedulingproblems
AT mendezcarlosa efficientmilpbaseddecompositionstrategyforsolvinglargescaleschedulingproblems
bdutipo_str Repositorios
_version_ 1764820489879945221

Ejemplares similares