Annals of Operations Research

, Volume 139, Issue 1, pp 131–162

Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications

Article

DOI: 10.1007/s10479-005-3446-x

Cite this article as:
Floudas, C.A. & Lin, X. Ann Oper Res (2005) 139: 131. doi:10.1007/s10479-005-3446-x

Abstract

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.

Keywords

chemical process schedulingmixed-integer linear programming (MILP)discrete-time modelcontinuous-time modelbranch and bound

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Department of Chemical EngineeringPrinceton UniversityPrincetonUSA