Journal
ANNALS OF OPERATIONS RESEARCH
Volume 139, Issue 1, Pages 131-162Publisher
SPRINGER
DOI: 10.1007/s10479-005-3446-x
Keywords
chemical process scheduling; mixed-integer linear programming (MILP); discrete-time model; continuous-time model; branch and bound
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available