THE PARALLEL-MACHINE COMMON DUE-DATE ASSIGNMENT AND SCHEDULING PROBLEM IS NP-HARD

被引:0
|
作者
CHENG, TCE
KAHLBACHER, HG
机构
[1] UNIV KAISERSLAUTERN,FAC MATH,W-6750 KAISERSLAUTERN,GERMANY
[2] UNIV MANITOBA,DEPT ACTUARIAL & MANAGEMENT SCI,WINNIPEG R3T 2N2,MANITOBA,CANADA
关键词
DUE-DATE ASSIGNMENT; SCHEDULING; SEQUENCING; NP-HARDNESS;
D O I
暂无
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In a recent paper, Cheng (1989) studied the problem of assigning a common due-date to a set of simultaneously available jobs and scheduling them on several parallel and identical machines to minimize the costs of due-date assignment, job earliness and tardiness. In this note, we present a proof that the problem is NP-hard and thus the use of heuristic solution methods can be justified.
引用
收藏
页码:235 / 238
页数:4
相关论文
共 50 条