State-of-the-art review of optimization methods for short-term scheduling of batch processes

• Published in: Computers & chemical engineering Vol. 30; no. 6; pp. 913 - 946
• Main Authors: Méndez, Carlos A., Cerdá, Jaime, Grossmann, Ignacio E., Harjunkoski, Iiro, Fahl, Marco
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01-05-2006
• Subjects: Batch processes; MILP; Optimization models; Short-term scheduling; Short-term scheduling; Optimization models; MILP; Batch processes
• ISSN: 0098-1354; 1873-4375
• DOI: 10.1016/j.compchemeng.2006.02.008

There has been significant progress in the area of short-term scheduling of batch processes, including the solution of industrial-sized problems, in the last 20 years. The main goal of this paper is to provide an up-to-date review of 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.