SCHEDULING UNIT TIME OPEN SHOPS TO MINIMIZE THE WEIGHTED NUMBER OF LATE JOBS

被引：6

作者：

BRUCKER, P ^{[1
]}

JURISCH, B ^{[1
]}

TAUTENHAHN, T ^{[1
]}

WERNER, F ^{[1
]}

机构：

[1] TECH UNIV OTTO VON GUERICKE,MAGDEBURG,GERMANY

来源：

OPERATIONS RESEARCH LETTERS | 1993年 / 14卷 / 05期

关键词：

OPEN SHOP; UNIT PROCESSING TIMES; DYNAMIC PROGRAMMING;

D O I：

10.1016/0167-6377(93)90088-X

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We present a polynomial algorithm for the problem of scheduling an open shop with unit time operations for a fixed number of machines such that the weighted number of late jobs is minimized. The algorithm is based on dynamic programming. The complexity of this problem was unknown for open shops with more than two machines.

引用

页码：245 / 250

页数：6