ON THE COMPLEXITY OF PREEMPTIVE OPEN-SHOP SCHEDULING PROBLEMS

被引：15

作者：

LIU, CY ^{[1
]}

BULFIN, RL ^{[1
]}

机构：

[1] AUBURN UNIV,DEPT IND ENGN,AUBURN,AL 36849

来源：

关键词：

D O I：

10.1016/0167-6377(85)90035-5

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：71 / 74

页数：4

共 10 条

[1]

ACHUGBUE JO, 1982, SIAM J COMPUT, V9, P306

CHO, Y ;

SAHNI, S .

[3] AN ALGORITHM FOR THE OPEN-SHOP PROBLEM [J].

FIALA, T .

[4]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[5] UNIT EXECUTION TIME SHOP PROBLEMS [J].

GONZALEZ, T .

[6]

GONZALEZ T, 1979, IEEE T COMPUT, V28, P782, DOI 10.1109/TC.1979.1675246

[7]

GONZALEZ T, 1976, J ACM, V23, P665, DOI 10.1145/321978.321985

[8]

Graham R. L., 1979, Discrete Optimisation, P287

[9]

LAGEWEG BJ, 1981, BW13881 STICHT MATH

[10]

LAWLER EL, 1981, MATH OPER RES, V6, P153, DOI 10.1287/moor.6.1.153