State-of-the-art review of optimization methods for short-term scheduling of batch processes
; Cerda, Jaime
; Grossmann, Ignacio E.
; Harjunkoski, Iiro
; Fahl, M. Otros responsables
Fecha
12/2006
Editorial
Elsevier
Revista
Computers and Chemical Engineering
Título del libro
Nombre del evento
Fecha del evento
Institución organizadora
ISSN
0098-1354
eISSN
ISBN
Idioma
Inglés
Tipo del evento
Clasificación temática
Palabras clave
Resumen
There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, inthe last 20 years. The main goal of this paper is to provide an up-to-date reviewof the state-of-the-art in this challenging area. Main features, strengths and limitations of existing modeling and optimization techniques as well as other available major solution methods are examined through this paper. We first present a general classification for scheduling problems of batch processes as well as for the corresponding optimization models. Subsequently, the modeling of representative optimization approaches for the different problem types are introduced in detail, focusing on both discrete and continuous time models. A comparison of effectiveness and efficiency of these models is given for two benchmarking examples from the literature. We also discuss two real-world applications of scheduling problems that cannot be readily accommodated using existing methods. For the sake of completeness, other alternative solution methods applied in the field of scheduling are also reviewed, followed by a discussion related to solving large-scale problems through rigorous optimization approaches. Finally,we list available academic and commercial software, and briefly address the issue of rescheduling capabilities of the various optimization approaches as well as important extensions that go beyond short-term batch scheduling.
Colecciones
Aprobación
Revisión
Complementado por
Referenciado por
Licencia Creative Commons
Excepto donde se indique lo contrario, la licencia de este ítem se describe como by-nc-sa
