A process scheduling problem arising from chemical production planning

被引：15

作者：

Burkard, RE

Hujter, M

Klinz, B

Rudolf, R

Wennink, M

机构：

[1] Graz Tech Univ, Inst Math B, A-8010 Graz, Austria

[2] Univ Miskolc, Dept Math Appl, H-3515 Miskolc Egyetemvaros, Hungary

[3] Tech Joanneum, Construct Engn & Management, A-8020 Graz, Austria

[4] BT Labs, Ipswich IP5 3RE, Suffolk, England

来源：

OPTIMIZATION METHODS & SOFTWARE | 1998年 / 10卷 / 02期

关键词：

multi-product and multi-facility production planning; batch production systems; scheduling problems; heuristics; special cases;

D O I：

10.1080/10556789808805710

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this paper we investigate scheduling problems which stem from real-world applications in the chemical process industry both from a theoretical and from a practical point of view. After providing a survey and a general mixed integer programming model, we present some results on the complexity of the process scheduling problem and investigate some important special cases. (We prove the NP-hardness in general and the polynomial solvability for specially structured cases.) Furthermore, we suggest a new heuristic approach and compare this to other heuristics known from the literature.

引用

页码：175 / 196

页数：22

共 15 条

[1]

AHLEFF J, 1995, THESIS RWTH AACHEN G

[2] Scheduling of a multi-product batch process in the chemical industry [J].