1547-5905/asset/AIC_left.gif?v=1&s=43a3d567c64d3d5d712c0af6c2cacb1e1bcc1a2b)
1547-5905/asset/AIC_right.gif?v=1&s=518efadeedca9ceeef271499f690fdebd2ed9164)
Process Systems Engineering
A general framework for process scheduling
Article first published online: 18 MAY 2010
DOI: 10.1002/aic.12300
Copyright © 2010 American Institute of Chemical Engineers (AIChE)
Additional Information
How to Cite
Sundaramoorthy, A. and Maravelias, C. T. (2011), A general framework for process scheduling. AIChE J., 57: 695–710. doi: 10.1002/aic.12300
Publication History
- Issue published online: 18 MAY 2010
- Article first published online: 18 MAY 2010
- Accepted manuscript online: 5 JUL 2010 10:00AM EST
- Manuscript Revised: 20 APR 2010
- Manuscript Received: 3 NOV 2009
Funded by
- National Science Foundation. Grant Number: CTS-0547443
Keywords:
- process scheduling;
- mixed-integer programming
Abstract
Existing 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