TY - JOUR
T1 - A novel network-based continuous-time representation for process scheduling
T2 - Part I. Main concepts and mathematical formulation
AU - Giménez, Diego M.
AU - Henning, Gabriela P.
AU - Maravelias, Christos T.
N1 - Funding Information:
This work has been supported by CONICET (PIP 5915), Universidad Nacional del Litoral (CAI + D 3-14, 2005), and the National Science Foundation under Grant CTS-0547443.
PY - 2009/9/9
Y1 - 2009/9/9
N2 - A novel network-based framework for the short-term scheduling of multi-purpose batch processes is presented. The novelty of the proposed approach lies in five key concepts. First, it is based on a new continuous-time representation that does not require tasks to start (end) exactly at a time point; thus reducing the number of time points needed to represent a solution. Second, processing units are modeled as being in different activity states to allow storage of input/output materials. Third, time variables for "idle" and "storage" periods of a unit are introduced to enable the matching between tasks and time points without big-M constraints. Fourth, material transfer variables are introduced to explicitly account for unit connectivity. Fifth, inventory variables for storage in processing units are incorporated to model non-simultaneous and partial material transfers. The proposed representation leads to MILP formulations which address limitations of existing scheduling methods.
AB - A novel network-based framework for the short-term scheduling of multi-purpose batch processes is presented. The novelty of the proposed approach lies in five key concepts. First, it is based on a new continuous-time representation that does not require tasks to start (end) exactly at a time point; thus reducing the number of time points needed to represent a solution. Second, processing units are modeled as being in different activity states to allow storage of input/output materials. Third, time variables for "idle" and "storage" periods of a unit are introduced to enable the matching between tasks and time points without big-M constraints. Fourth, material transfer variables are introduced to explicitly account for unit connectivity. Fifth, inventory variables for storage in processing units are incorporated to model non-simultaneous and partial material transfers. The proposed representation leads to MILP formulations which address limitations of existing scheduling methods.
KW - Mixed-integer linear programming
KW - Network-based continuous-time representation
KW - Process scheduling
UR - http://www.scopus.com/inward/record.url?scp=67651092136&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67651092136&partnerID=8YFLogxK
U2 - 10.1016/j.compchemeng.2009.03.007
DO - 10.1016/j.compchemeng.2009.03.007
M3 - Article
AN - SCOPUS:67651092136
SN - 0098-1354
VL - 33
SP - 1511
EP - 1528
JO - Computers and Chemical Engineering
JF - Computers and Chemical Engineering
IS - 9
ER -