journal article Feb 08, 2011

A general framework for process scheduling

AIChE Journal Vol. 57 No. 3 pp. 695-710 · Wiley
View at Publisher Save 10.1002/aic.12300
Abstract
AbstractExisting methods for process scheduling can be broadly classified as network‐based or sequential. The former are used to address problems where different batches of the same or different tasks are freely mixed or split, whereas the latter are used to address problems where batch mixing/splitting is not allowed. A framework is proposed that allows us to: (1) express scheduling problems in facilities that consist of network and sequential, as well as continuous subsystems, (2) formulate mixed‐integer programming (MIP) scheduling models for such problems, and (3) solve the resulting MIP formulations effectively. The proposed framework bridges the gap between network and sequential approaches, thereby addressing the major formulation challenge in the area of process scheduling, namely, the development of a framework that can be used to address a wide spectrum of problems. © 2010 American Institute of Chemical Engineers AIChE J, 57: 695–710, 2011
Topics

No keywords indexed for this article. Browse by subject →

Cited By
47
European Journal of Operational Res...
Metrics
47
Citations
30
References
Details
Published
Feb 08, 2011
Vol/Issue
57(3)
Pages
695-710
License
View
Cite This Article
Arul Sundaramoorthy, Christos T. Maravelias (2011). A general framework for process scheduling. AIChE Journal, 57(3), 695-710. https://doi.org/10.1002/aic.12300
Related

You May Also Like

Local compositions in thermodynamic excess functions for liquid mixtures

Henri Renon, J. M. Prausnitz · 1968

6,220 citations

Pore and solid diffusion models for fixed‐bed adsorbers

Thomas W. Weber, Ranjit K. Chakravorti · 1974

2,133 citations