A PSEUDO-POLYNOMIAL ALGORITHM FOR A 2-MACHINE NO-WAIT JOB-SHOP SCHEDULING PROBLEM

被引：19

作者：

KUBIAK, W

机构：

来源：

关键词：

D O I：

10.1016/0377-2217(89)90225-7

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：267 / 270

页数：4

共 8 条

[1] Blazewicz J., 1988, Annals of Operations Research, V16, P255, DOI 10.1007/BF02283747
[2] MINIMIZING MAXIMUM LATENESS IN A 2-MACHINE UNIT-TIME JOB SHOP
BRUCKER, P
[J]. COMPUTING, 1981, 27 (04) : 367 - 370
[3] BRUCKER P, 1982, LECT NOTES CONTROL I, V38, P566
[4] Garey MR., 1979, COMPUTERS INTRACTABI
[5] HEFETZ I, 1982, MATH OPER RES, V7, P354
[6] Lenstra J. K., 1979, ANN DISCRETE MATH, V4, P121, DOI DOI 10.1016/S0167-5060(08)70821-5
[7] Sahni S., 1979, Mathematics of Operations Research, V4, P448, DOI 10.1287/moor.4.4.448
[8] SOME NO-WAIT SHOPS SCHEDULING PROBLEMS - COMPLEXITY ASPECT
SRISKANDARAJAH, C
LADET, P
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 24 (03) : 424 - 438