Short-term scheduling: New mathematical models vs algorithmic improvements
Short-term scheduling: New mathematical models vs algorithmic improvements
复制标题
DOI：
10.1016/s0098-1354(98)00083-0
复制
发表时间：
1998-01-01
影响因子：
4.3
通讯作者：
Floudas, CA
中科院分区：
文献类型：
--
作者：
Ierapetritou, MG;Floudas, CA
本文提出了一种新的间歇式工厂短期调度公式。该公式基于连续时间表示，结果是一个混合整数线性规划（MILP）问题。与先前发表的连续时间调度公式相比，该方法可以得到更小、更简单的数学模型，具有更少的二进制和连续变量，更小的完整性间隙，更少的约束，更少的线性规划松弛，并且可以在更少的CPU时间内求解。举例说明了所提出的公式的有效性，并与其他方法进行了比较。1998爱思唯尔科学有限公司版权所有。
In this paper, a novel formulation is presented for the short-term scheduling of batch plants. The proposed formulation is based on a continuous time representation and results in a Mixed Integer Linear Programming (MILP) problem. In contrast to the previously published continuous-time scheduling formulations, the proposed approach leads to smaller and simpler mathematical models which exhibit fewer binary and continuous variables, have smaller integrality gaps, require fewer constraints, need fewer linear programming relaxations, and can be solved in significantly less CPU time. Several examples are presented that illustrate the effectiveness of the proposed formulation and comparisons with other approaches are provided. (C) 1998 Elsevier Science Ltd. All rights reserved.