Applying MILP-based algorithms to automated job-shop scheduling problems in aircraft-part manufacturing
This work presents efficient algorithms based on Mixed-Integer Linear Programming (MILP) for complex job-shop scheduling problems raised in Automated Manufacturing Systems. The aim of this work is to find alternative solution approaches of production and transportation operations in a multi-product...
Guardado en:
| Autores principales: | Aguirre, A.M., Méndez, C.A., García Sánchez, A., Ortega Mier, M. |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2013
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/94312 |
| Aporte de: |
Ejemplares similares
-
Multiobjective evolutionary algorithms for job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2001) -
Multirecombinated evolutionary algorithms to solve multiobjective job shop scheduling
por: Esquivel, Susana Cecilia, et al.
Publicado: (2000) -
An improved ant colony algorithm for the job shop scheduling problem
por: Leguizamón, Guillermo, et al.
Publicado: (2002) -
Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001) -
An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems
por: Basán, Natalia P., et al.
Publicado: (2019)