dc.creatorAguirre, A.M.
dc.creatorMéndez, C.A.
dc.creatorGarcía Sánchez, A.
dc.creatorOrtega Mier, M.
dc.date2013-09
dc.date2013
dc.date2020-04-27T12:52:14Z
dc.date.accessioned2023-07-14T19:29:56Z
dc.date.available2023-07-14T19:29:56Z
dc.identifierhttp://sedici.unlp.edu.ar/handle/10915/94312
dc.identifierissn:2313-9102
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/7435539
dc.descriptionThis 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 multistage production process that can be used to solve industrial-scale problems with reasonable computational effort. The MILP model developed must take into account; dissimilar recipes, single unit per production stage, re-entrant flows, sequence- dependent free transferring times and load transfer movements in a single automated material-handling device. In addition, logical-based strategies are proposed to iteratively find and improve the solutions generated over time. These approaches were tested in different real-world problems appeared in the surfacetreatment process of metal components in aircraft manufacturing industry.
dc.descriptionSociedad Argentina de Informática e Investigación Operativa
dc.formatapplication/pdf
dc.format1-12
dc.languageen
dc.rightshttp://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rightsCreative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.subjectCiencias Informáticas
dc.subjectMILP-based algorithm
dc.subjectAutomated Manufacturing Systems
dc.subjectJob-shop Scheduling problems
dc.titleApplying MILP-based algorithms to automated job-shop scheduling problems in aircraft-part manufacturing
dc.typeObjeto de conferencia
dc.typeObjeto de conferencia


Este ítem pertenece a la siguiente institución