Artículo
Applying MILP/Heuristic algorithms to automated job-shop scheduling problems in aircraft-part manufacturing
Fecha de publicación:
12/2013
Editorial:
Universidad Nacional de Santa Catarina
Revista:
Iberoamerican Journal of Industrial Engineering
e-ISSN:
2175-8018
Idioma:
Inglés
Tipo de recurso:
Artículo publicado
Clasificación temática:
Resumen
This work presents efficient algorithms based on Mixed-Integer Linear Programming (MILP) and heuristic strategies for complex job-shop scheduling problems raised in Automated Manufacturing Systems. The aim of this work is to find alternative a solution approach of production and transportation operations in a multi-product multi-stage production system that can be used to solve industrial-scale problems with a reasonable computational effort. The MILP model developed must take into account; heterogeneous recipes, single unit per stage, possible recycle flows, sequence-dependent free transferring times and load transfer movements in a single automated material-handling device. In addition, heuristic-based strategies are proposed to iteratively find and improve the solutions generated over time. These approaches were tested in different real-world problems arising in the surface-treatment process of metal components in the aircraft manufacturing industry.
Archivos asociados
Licencia
Identificadores
Colecciones
Articulos(INTEC)
Articulos de INST.DE DES.TECNOL.PARA LA IND.QUIMICA (I)
Articulos de INST.DE DES.TECNOL.PARA LA IND.QUIMICA (I)
Citación
Aguirre, Adrian Marcelo; Mendez, Carlos Alberto; García Sanchez, Alvaro; Ortega Mier, Miguel; Applying MILP/Heuristic algorithms to automated job-shop scheduling problems in aircraft-part manufacturing; Universidad Nacional de Santa Catarina; Iberoamerican Journal of Industrial Engineering; 5; 10; 12-2013; 26-41
Compartir