ON THE COMPLEXITY OF PREEMPTIVE OPENSHOP SCHEDULING PROBLEMS

被引：3
|
作者：
SRISKANDARAJAH, C
WAGNEUR, E
机构：
[1] GERAD, MONTREAL, PQ, CANADA
[2] UNIV TORONTO, DEPT IND ENGN, TORONTO M5S 1A4, ONTARIO, CANADA
[3] ECOLE MINES, LAN, NANTES, FRANCE
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1994年 / 77卷 / 03期
关键词：
PREEMPTIVE OPENSHOP SCHEDULING; FINISH TIME; MEAN FLOW TIME; TOTAL WEIGHTED TARDINESS; MAXIMUM LATENESS; NUMBER OF LATE JOBS; NP-HARD; NP-COMPLETE;
D O I：
10.1016/0377-2217(94)90406-5
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We investigate the complexity status of the preemptive openshop scheduling problem. After reviewing recent studies of the shop with various objective functions, we define the concept of preempting job w.r. to a schedule, and state some general results for the preemptive openshop environment. These results are then used to show by reduction from the 3-Partition, that the n job-2 machine mean flow time problem with ready times and job preemption is unary NP-hard.
引用
收藏
页码：404 / 414
页数：11
相关论文
共 50 条
12345