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....
Guardado en:
| Autores principales: | Basán, Natalia P., Cóccola, Mariana E., Méndez, Carlos A. |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2019
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/89504 |
| Aporte de: |
Ejemplares similares
-
Scheduling of flexible manufacturing plants with redesign options : a MILP-based decomposition algorithm and case studies
por: Basán, Natalia P., et al.
Publicado: (2021) -
Applying MILP-based algorithms to automated job-shop scheduling problems in aircraft-part manufacturing
por: Aguirre, A.M., et al.
Publicado: (2013) -
A Simple Differential Evolution Algorithm to Solve the Flexible Job Shop Scheduling Problem
por: Morero, Franco, et al.
Publicado: (2019) -
An effective continuous-time formulation for scheduling optimization in a shipbuilding assembly process
por: Basán, Natalia P., et al.
Publicado: (2017) -
An MILP model for planning of batch plants operating in a campaign- mode
por: Fumero, Yanina, et al.
Publicado: (2018)