Article ID: | iaor2006782 |
Country: | Netherlands |
Volume: | 139 |
Issue: | 1 |
Start Page Number: | 131 |
End Page Number: | 162 |
Publication Date: | Oct 2005 |
Journal: | Annals of Operations Research |
Authors: | Floudas Christodoulos A., Lin Xiaoxia |
Keywords: | manufacturing industries, programming: branch and bound, programming: integer |
This paper reviews the advances of mixed-integer linear programming (MILP) based approaches for the scheduling of chemical processing systems. We focus on the short-term scheduling of general network represented processes. First, the various mathematical models that have been proposed in the literature are classified mainly based on the time representation. Discrete-time and continuous-time models are presented along with their strengths and limitations. Several classes of approaches for improving the computational efficiency in the solution of MILP problems are discussed. Furthermore, a summary of computational experiences and applications is provided. The paper concludes with perspectives on future research directions for MILP based process scheduling technologies.