.png){kind=icon}
Return
Mixed integer linear programming in process scheduling: Modeling, algorithms, and applications
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-005-3446-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 scheduling
mixed-integer linear programming (MILP)
discrete-time model
continuous-time model
branch and bound
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSaveShareSave
View more