Producción CyT
Artículo
Autoría
Castro, Pedro M.
;
Aguirre, Adrian Marcelo
;
ZEBALLOS, LUIS JAVIER
;
MENDEZ, CARLOS ALBERTO
Fecha
2011
Editorial y Lugar de Edición
AMER CHEMICAL SOC
Revista
INDUSTRIAL & ENGINEERING CHEMICAL RESEARCH,
vol. 50
(pp. 10665-10680)
AMER CHEMICAL SOC
Resumen
Información suministrada por el agente en
SIGEVA
This article presents a new algorithm for industrially sized problems that, because of the large number of tasks to schedule, are either intractable or result in poor solutions when solved with full-space mathematical programming approaches. Focus is set on a special type of multistage batch plant featuring a single unit per stage, zero-wait storage policies, and a single transportation device for moving lots between stages. The algorithm incorporates a mixed-integer linear programming (MILP) c...
This article presents a new algorithm for industrially sized problems that, because of the large number of tasks to schedule, are either intractable or result in poor solutions when solved with full-space mathematical programming approaches. Focus is set on a special type of multistage batch plant featuring a single unit per stage, zero-wait storage policies, and a single transportation device for moving lots between stages. The algorithm incorporates a mixed-integer linear programming (MILP) continuous-time formulation and a discrete-event simulation model to generate a detailed schedule. More precisely, three stages are involved: (i) finding the best processing sequence, assuming that the transportation device is always available; (ii) generating a feasible schedule, taking into account the shared transportation resource; (iii) improving the schedule through a neighborhood search procedure. Relaxed and constrained versions of the full-space MILP are involved in stages (i) and (iii) with the simulation model taking care of stage (ii). Several examples are solved to illustrate the capabilities of the proposed method with the results showing better performance when compared to other published approaches. The balance between solution quality and total computational effort can easily be shifted by changing the number of lots rescheduled per iteration.
Ver más
Ver menos
Palabras Clave
MIXED-INTEGER LINEAR PROGRAMMINGOPTIMIZATIONSHORT-TERM SCHEDULING
Descargue o solicite el texto completo