Job shop scheduling with deadlines

被引：15

作者：

Balas, E ^{[1
]}

Lancia, G

Serafini, P

Vazacopoulos, A

机构：

[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA

[2] Univ Udine, I-33100 Udine, Italy

[3] Fairleigh Dickinson Univ, Teaneck, NJ USA

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 1998年 / 1卷 / 04期

基金：

美国国家科学基金会;

关键词：

scheduling; deadlines; shifting bottleneck;

D O I：

10.1023/A:1009750409895

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper we deal with a variant of the Job Shop Scheduling Problem. We consider the addition of release dates and deadlines to be met by all jobs. The objective is makespan minimization if there are no tardy jobs, and tardiness minimization otherwise. The problem is approached by using a Shifting Bottleneck strategy. The presence of deadlines motivates an iterative use of a particular one machine problem which is solved optimally. The overall procedure is heuristic and exhibits a good trade-off between computing time and solution quality.

引用

页码：329 / 353

页数：25

共 9 条

[1] THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING [J].