Optimal scheduling of a resource-constrained multiproduct batch plant supplying intermediates to nearby end-product facilities

被引:41
作者
Méndez, CA [1 ]
Cerdá, J [1 ]
机构
[1] Univ Nacl Litoral, CONICET, Inst Desarrollo Tecnol Ind Quim, RA-3000 Santa Fe, Argentina
关键词
scheduling; batch plant; optimization model;
D O I
10.1016/S0098-1354(00)00482-8
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper is concerned with the short-term scheduling of a two-stage multiproduct batch plant where a number of intermediate products are processed to deliver to nearby end-product facilities. The common processing sequence involves a single stage with multiple parallel units and a subsequent storage stage. After processing, the batches of intermediate products are transferred to tanks of different capacities from which they are supplied to end-product facilities. Any storage tank is connected to a group of such facilities and sequentially allocated to different compatible products. Topology constraints restricting the interconnections among processing units and tanks are additional conditions to be considered. Intermediate requirements are given in terms of batches, some of them involving the same product but featuring different sizes and due shifts. Since a constant consumption rate is assumed throughout the due shift, then every batch will remain during such a period of time in the assigned tank. A continuous-time MILP mathematical model that accounts for sequence-dependent changeover times and multiple product deliveries at specified time intervals and, in addition, easily embed preordering conditions has been developed. The proposed formulation has been successfully applied to the solution of a large-scale industrial problem. The optimal schedule was found in a quite reasonable CPU time by solving a single MILP model featuring a much smaller size than previous approaches. (C) 2000 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:369 / 376
页数:8
相关论文
共 8 条
[1]  
*ILOG, 1999, ILOG OPL STUD 2 1 US
[2]   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
[3]  
MENDEZ CA, 1999, P 2 PAN AM WORKSH CA
[4]   Mathematical programming formulation for scheduling of batch operations based on nonuniform time discretization [J].
Mockus, L ;
Reklaitis, GV .
COMPUTERS & CHEMICAL ENGINEERING, 1997, 21 (10) :1147-1156
[5]   A CONTINUOUS-TIME MIXED-INTEGER LINEAR-PROGRAMMING MODEL FOR SHORT-TERM SCHEDULING OF MULTISTAGE BATCH PLANTS [J].
PINTO, JM ;
GROSSMANN, IE .
INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH, 1995, 34 (09) :3037-3051
[6]  
PINTO JM, 1999, P 2 PAN AM WORKSH CA
[7]   A GENERAL ALGORITHM FOR SHORT-TERM SCHEDULING OF BATCH-OPERATIONS .2. COMPUTATIONAL ISSUES [J].
SHAH, N ;
PANTELIDES, CC ;
SARGENT, RWH .
COMPUTERS & CHEMICAL ENGINEERING, 1993, 17 (02) :229-244
[8]  
Zhang XY, 1998, COMPUT CHEM ENG, V22, P1287, DOI 10.1016/S0098-1354(98)00013-1