A note on the proof of the complexity of the little-preemptive open-shop problem

被引：3

作者：

Shchepin, Evgeny V. ^{[2
]}

Vakhania, Nodari ^{[1
]}

机构：

[1] State Univ Morelos, Fac Sci, Cuernavaca 62210, Morelos, Mexico

[2] Steklov Math Inst, Moscow 117966, Russia

来源：

ANNALS OF OPERATIONS RESEARCH | 2011年 / 191卷 / 01期

关键词：

Open-shop scheduling; Preemption; Algorithm; NP-hardness;

D O I：

10.1007/s10479-011-0975-3

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We give a complement note on the proof of the NP-hardness of preemptive acyclic open-shop problem presented earlier by the authors in Ann. Oper. Res. 159:183-213, 2008.

引用

页码：251 / 253

页数：3

共 50 条

[1] A note on the proof of the complexity of the little-preemptive open-shop problem
Evgeny V. Shchepin
Nodari Vakhania
Annals of Operations Research, 2011, 191 : 251 - 253
[2] ON THE COMPLEXITY OF PREEMPTIVE OPEN-SHOP SCHEDULING PROBLEMS
LIU, CY
BULFIN, RL
OPERATIONS RESEARCH LETTERS, 1985, 4 (02) : 71 - 74
[3] On the complexity of constructing multiprocessor little-preemptive schedules
Shchepin, E. V.
PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2015, 290 (01) : 166 - 177
[4] On the complexity of constructing multiprocessor little-preemptive schedules
E. V. Shchepin
Proceedings of the Steklov Institute of Mathematics, 2015, 290 : 166 - 177
[5] The routing open-shop problem on a network: Complexity and approximation
Averbakh, Igor
Berman, Oded
Chernykh, Ilya
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (02) : 531 - 539
[6] AN ALGORITHM FOR THE OPEN-SHOP PROBLEM
FIALA, T
MATHEMATICS OF OPERATIONS RESEARCH, 1983, 8 (01) : 100 - 109
[7] A note on the complexity of the concurrent open shop problem
Thomas A. Roemer
Journal of Scheduling, 2006, 9 : 389 - 396
[8] A note on the complexity of the concurrent open shop problem
Roemer, TA
JOURNAL OF SCHEDULING, 2006, 9 (04) : 389 - 396
[9] DUAL CRITERIA PREEMPTIVE OPEN-SHOP PROBLEMS WITH MINIMUM MAKESPAN
VAIRAKTARAKIS, G
SAHNI, S
NAVAL RESEARCH LOGISTICS, 1995, 42 (01) : 103 - 121
[10] Preemptive Open-shop Scheduling: Network Flow based Algorithm
Zhan, Y.
Zhong, Y. G.
Zhu, H. T.
DIGITAL DESIGN AND MANUFACTURING TECHNOLOGY II, 2011, 215 : 111 - 114

← 1 2 3 4 5 →