STBS: A continuous-time MILP optimization for short-term scheduling of batch plants

被引：15

作者：

Pinto, JM

Turkay, A

Bolio, B

Grossmann, IE ^{[1
]}

机构：

[1] Carnegie Mellon Univ, Dept Chem Engn, Pittsburgh, PA 15213 USA

[2] Univ Sao Paulo, Dept Chem Engn, BR-05508 Sao Paulo, Brazil

来源：

COMPUTERS & CHEMICAL ENGINEERING | 1998年 / 22卷 / 09期

关键词：

optimization model; batch plants; continuous-time;

D O I：

10.1016/S0098-1354(98)00014-3

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This is a paper on mixed integer linear programming models for short-term scheduling of batch plants as described by Pinto and Grossmann (1995, 1996). The models rely on continuous-time representation and make use of pre-ordering constraints, which can be either imposed as a separate set of constraints or can be included in the underlying representation for the model. We also describe the computer interface STBS which automatically formulates the models and generates solution outputs such as Gantt charts and order paths. As shown in the results, problems up to 50 orders in 25 machines and five stages can be solved in approximately 20 min. (C) 1998 Elsevier Science Ltd. All rights reserved.

引用

页码：1297 / 1308

页数：12

共 8 条

[1]

Brooke A., 1992, GAMS A User's Guide. Release 2.25

[2]

French S., 1982, Sequencing and Scheduling

[3]

*OSL IBM, 1991, OSL GUID REF REL 2

[4]

PADBERG M, 1994, NAV RES LOG, V41, P395, DOI 10.1002/1520-6750(199404)41:3<395::AID-NAV3220410307>3.0.CO