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 条
  • [21] Competitive genetic algorithms for the open-shop scheduling problem
    Prins, C
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2000, 52 (03) : 389 - 411
  • [22] Extended Genetic Algorithm for solving open-shop scheduling problem
    Ali Asghar Rahmani Hosseinabadi
    Javad Vahidi
    Behzad Saemi
    Arun Kumar Sangaiah
    Mohamed Elhoseny
    Soft Computing, 2019, 23 : 5099 - 5116
  • [23] Complexity Results for Flow-Shop and Open-Shop Scheduling Problems with Transportation Delays
    Peter Brucker
    Sigrid Knust
    T.C. Edwin Cheng
    Natalia V. Shakhlevich
    Annals of Operations Research, 2004, 129 : 81 - 106
  • [24] On the open-shop problem with preemption and minimizing the average completion time
    Bräsel, H
    Hennes, H
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 157 (03) : 607 - 619
  • [25] PSO based scheduling algorithm for open-shop scheduling problem
    Department of Industrial and Manufacturing System Engineering, Huazhong University of Science and Technology, Wuhan 430074, China
    Jixie Gongcheng Xuebao, 2006, 2 (129-134):
  • [26] Extended Genetic Algorithm for solving open-shop scheduling problem
    Hosseinabadi, Ali Asghar Rahmani
    Vahidi, Javad
    Saemi, Behzad
    Sangaiah, Arun Kumar
    Elhoseny, Mohamed
    SOFT COMPUTING, 2019, 23 (13) : 5099 - 5116
  • [27] Classical and new heuristics for the open-shop problem: A computational evaluation
    Gueret, C
    Prins, C
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 107 (02) : 306 - 314
  • [28] Four decades of research on the open-shop scheduling problem to minimize the makespan
    Ahmadian, Mohammad Mahdi
    Khatami, Mostafa
    Salehipour, Amir
    Cheng, T. C. E.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 295 (02) : 399 - 426
  • [29] A PREEMPTIVE OPEN SHOP SCHEDULING PROBLEM WITH ONE RESOURCE
    DEWERRA, D
    BLAZEWICZ, J
    KUBIAK, W
    OPERATIONS RESEARCH LETTERS, 1991, 10 (01) : 9 - 15
  • [30] A POLYNOMIAL-TIME OPEN-SHOP PROBLEM WITH AN ARBITRARY NUMBER OF MACHINES
    SEVASTYANOV, SV
    CYBERNETICS AND SYSTEMS ANALYSIS, 1992, 28 (06) : 918 - 933
12345