TY - JOUR
T1 - Unit-specific event-based continuous-time approach for short-term scheduling of batch plants using RTN framework
AU - Shaik, Munawar A.
AU - Floudas, Christodoulos A.
N1 - Funding Information:
The authors gratefully acknowledge support from the National Science Foundation and BASF Aktiengesellschaft, Ludwigshafen, Germany.
PY - 2008/1
Y1 - 2008/1
N2 - The problem of short-term scheduling of batch plants has received remarkable attention in the past two decades. The state-task-network (STN) and resource-task-network (RTN) process representations are extensively used in modeling scheduling problems. In this paper, we propose a new model to investigate the RTN representation for unit-specific event-based models. For handling dedicated finite storage, a novel formulation is proposed without the need for considering storage as a separate task. The performance of the proposed model is evaluated along with several other continuous-time models from the literature based on the STN and RTN process representations. The various models are assessed based on our implementations using several benchmark example problems from the literature. Two different objective functions, maximization of profit and minimization of makespan, are considered. Two storage policies, unlimited and dedicated finite storage cases are also considered.
AB - The problem of short-term scheduling of batch plants has received remarkable attention in the past two decades. The state-task-network (STN) and resource-task-network (RTN) process representations are extensively used in modeling scheduling problems. In this paper, we propose a new model to investigate the RTN representation for unit-specific event-based models. For handling dedicated finite storage, a novel formulation is proposed without the need for considering storage as a separate task. The performance of the proposed model is evaluated along with several other continuous-time models from the literature based on the STN and RTN process representations. The various models are assessed based on our implementations using several benchmark example problems from the literature. Two different objective functions, maximization of profit and minimization of makespan, are considered. Two storage policies, unlimited and dedicated finite storage cases are also considered.
KW - Batch plants
KW - Continuous-time
KW - Finite storage
KW - Resource-task-network
KW - Short-term scheduling
KW - State-task-network
KW - Unit-specific event-based
UR - http://www.scopus.com/inward/record.url?scp=35549009402&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=35549009402&partnerID=8YFLogxK
U2 - 10.1016/j.compchemeng.2007.05.007
DO - 10.1016/j.compchemeng.2007.05.007
M3 - Article
AN - SCOPUS:35549009402
SN - 0098-1354
VL - 32
SP - 260
EP - 274
JO - Computers and Chemical Engineering
JF - Computers and Chemical Engineering
IS - 1-2
ER -