A novel continuous-time MILP formulation for multipurpose batch plants. 1. Short-term scheduling

被引:68
作者
Majozi, T [1 ]
Zhu, XX [1 ]
机构
[1] Univ Manchester, Inst Sci & Technol, Dept Proc Integrat, Manchester M60 1QD, Lancs, England
关键词
D O I
10.1021/ie0005452
中图分类号
TQ [化学工业];
学科分类号
0817 ;
摘要
In this paper, a new concept, the so-called state sequence network representation, is presented. This representation is based on states only, eliminating the use of tasks and units. Using this new representation as a basis, a novel continuous-time MILP formulation for short-term scheduling of multipurpose batch plants is developed. The presented formulation can readily be extended to intermediate due date scenarios. Also presented in this paper is a new model for the duration constraints that explores degrees of freedom that are intrinsic in batch operations. These are due to operator intervention, raw material purity, and different catalyst types. Time points are used to denote the use or production of a particular state. This formulation leads to the least number of binary variables and much better results when compared to other continuous-time formulations published in the literature. The reduced number of binary variables is a result of considering states only, thereby eliminating binary variables corresponding to tasks and units. This method has been applied to literature examples and industrial problems which show significant improvement in reducing the number of binary variables and, hence, CPU times. The last section of this paper introduces the concept of units aggregation in reducing the binary dimension of large-scale problems. This makes it possible for the method to solve large-scale industrial problems. In the second paper of this series (Zhu, X. X.; Majozi, T. Ind. Eng. Chem. Res. 2001, 40, 5621-5634), it will be demonstrated how this formulation is applied in the context of integrated planning and scheduling.
引用
收藏
页码:5935 / 5949
页数:15
相关论文
共 19 条
[1]  
[Anonymous], MATH PROGR
[2]   IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS [J].
GLOVER, F .
MANAGEMENT SCIENCE, 1975, 22 (04) :455-460
[3]   OPTIMUM DESIGN OF MULTIPURPOSE CHEMICAL-PLANTS [J].
GROSSMANN, IE ;
SARGENT, RWH .
INDUSTRIAL & ENGINEERING CHEMISTRY PROCESS DESIGN AND DEVELOPMENT, 1979, 18 (02) :343-348
[4]   Effective continuous-time formulation for short-term scheduling. 1. Multipurpose batch processes [J].
Ierapetritou, MG ;
Floudas, CA .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 1998, 37 (11) :4341-4359
[5]   Effective continuous-time formulation for short-term scheduling.: 3.: Multiple intermediate due dates [J].
Ierapetritou, MG ;
Hené, TS ;
Floudas, CA .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 1999, 38 (09) :3446-3461
[6]   Planning and scheduling of parallel semicontinuous processes .2. Short-term scheduling [J].
Karimi, IA ;
McDonald, CM .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 1997, 36 (07) :2701-2714
[7]   OPTIMAL-DESIGN OF BATCH SEMI-CONTINUOUS PROCESSES [J].
KNOPF, FC ;
OKOS, MR ;
REKLAITIS, GV .
INDUSTRIAL & ENGINEERING CHEMISTRY PROCESS DESIGN AND DEVELOPMENT, 1982, 21 (01) :79-80
[8]   A GENERAL ALGORITHM FOR SHORT-TERM SCHEDULING OF BATCH-OPERATIONS .1. MILP FORMULATION [J].
KONDILI, E ;
PANTELIDES, CC ;
SARGENT, RWH .
COMPUTERS & CHEMICAL ENGINEERING, 1993, 17 (02) :211-227
[9]   A synthesis of multiproduct batch plants considering both in-phase and out-of-phase modes [J].
Lee, HK ;
Lee, IB .
COMPUTERS & CHEMICAL ENGINEERING, 1996, 20 :S195-S200
[10]   OPTIMAL CYCLIC SCHEDULING OF MULTISTAGE CONTINUOUS MULTIPRODUCT PLANTS [J].
PINTO, JM ;
GROSSMANN, IE .
COMPUTERS & CHEMICAL ENGINEERING, 1994, 18 (09) :797-816