A continuous time MILP model for short term scheduling of batch plants with pre-ordering constraints

被引:27
作者
Pinto, JM
Grossmann, LE
机构
[1] CARNEGIE MELLON UNIV, DEPT CHEM ENGN, PITTSBURGH, PA 15213 USA
[2] UNIV SAO PAULO, DEPT CHEM ENGN, BR-05503 SAO PAULO, SP, BRAZIL
基金
巴西圣保罗研究基金会; 美国国家科学基金会;
关键词
D O I
10.1016/0098-1354(96)00207-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This is a paper on an alternate model when pre-ordering constraints are imposed in short term scheduling of batch plants described by Pinto and Grossmann (1995). The idea is to include the assumption of pre-ordering of orders to units in the underlying representation for the model, as opposed to including pre-ordering as a separate set of constraints. The resulting model is not only conceptually simple, but also results in shorter solution times.
引用
收藏
页码:S1197 / S1202
页数:6
相关论文
共 4 条
[1]  
Brook A., 1992, GAMS A User's Guide
[2]  
French S., 1982, Sequencing and Scheduling
[3]  
*OSL IBM, 1991, OSL GUID REF
[4]   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