MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD

被引:537
作者
DU, JZ
LEUNG, JYT
机构
关键词
D O I
10.1287/moor.15.3.483
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 [运筹学与控制论]; 12 [管理学]; 1201 [管理科学与工程]; 1202 [工商管理学]; 120202 [企业管理];
摘要
引用
收藏
页码:483 / 495
页数:13
相关论文
共 15 条
[1]
Baker K., 1974, INTRO SEQUENCING SCH
[2]
Coffman E.G., 1976, COMPUTER JOB SHOP SC
[3]
DU J, 1988, UTDCS288 U TEX DALL
[4]
[5]
Garey M.R., 1979, COMPUTERS INTRACTABI, V174
[6]
Kan A. R., 2012, MACHINE SCHEDULING P, DOI DOI 10.1016/0377-2217(77)90029-7
[7]
KAN AHG, 1975, OPER RES, V23, P908
[8]
COMPUTER-AIDED COMPLEXITY CLASSIFICATION OF COMBINATORIAL PROBLEMS [J].
LAGEWEG, BJ ;
LENSTRA, JK ;
LAWLER, EL ;
KAN, AHGR .
COMMUNICATIONS OF THE ACM, 1982, 25 (11) :817-822
[9]
Lawler E., 1982, P PART NATO ADV STUD, V84, P35
[10]
Lawler E. L., 1977, ANN DISCRETE MATH, V1, P331, DOI [DOI 10.1016/S0167-5060(08)70742-8, 10.1016/S0167-5060(08)70742-8]