Two-machine open shop scheduling with an availability constraint

被引：27
|
作者：
Breit, J [1 ]
Schmidt, G
Strusevich, VA
机构：
[1] Univ Saarland, Dept Informat & Technol Management, D-66041 Saarbrucken, Germany
[2] Tech Univ Clausthal, Inst Informat, D-38678 Clausthal Zellerfeld, Germany
[3] Univ Greenwich, Sch Comp & Math Sci, London SE10 9LS, England
来源：
OPERATIONS RESEARCH LETTERS | 2001年 / 29卷 / 02期
关键词：
open shop scheduling; availability constraints; worst-case analysis;
D O I：
10.1016/S0167-6377(01)00079-7
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
We study a two-machine open shop scheduling problem, in which one machine is not available for processing during a given time interval. The objective is to minimize the makespan. We show that the problem is NP-hard and present an approximation algorithm with a worst-case ratio of 4/3. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：65 / 77
页数：13
相关论文
共 50 条
  • [41] Constraint Programming for the Robust Two-Machine Flow-Shop Scheduling Problem with Budgeted Uncertainty
    Juvin, Carla
    Houssin, Laurent
    Lopez, Pierre
    INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, CPAIOR 2023, 2023, 13884 : 354 - 369
  • [42] A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
    Antonina P. Khramova
    Ilya Chernykh
    Journal of Scheduling, 2021, 24 : 405 - 412
  • [43] Scheduling the two-machine open shop problem under resource constraints for setting the jobs
    Ammar Oulamara
    Djamal Rebaine
    Mehdi Serairi
    Annals of Operations Research, 2013, 211 : 333 - 356
  • [44] An efficient tabu search approach for the two-machine preemptive open shop scheduling problem
    Liaw, CF
    COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (14) : 2081 - 2095
  • [45] Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
    Dawei Li
    Xiwen Lu
    Journal of Combinatorial Optimization, 2020, 39 : 1060 - 1078
  • [46] Two-machine flow shop scheduling with an operator non-availability period to minimize makespan
    Li, Dawei
    Lu, Xiwen
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (04) : 1060 - 1078
  • [47] A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
    Khramova, Antonina P.
    Chernykh, Ilya
    JOURNAL OF SCHEDULING, 2021, 24 (04) : 405 - 412
  • [48] Scheduling the two-machine open shop problem under resource constraints for setting the jobs
    Oulamara, Ammar
    Rebaine, Djamal
    Serairi, Mehdi
    ANNALS OF OPERATIONS RESEARCH, 2013, 211 (01) : 333 - 356
  • [49] Scheduling of a two-machine flowshop with availability constraints on the first machine
    Allaoui, H
    Artiba, A
    Elmaghraby, SE
    Riane, F
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 99 (1-2) : 16 - 27
  • [50] Two-machine open shop problem with agreement graph
    Tellache, Nour El Houda
    Boudhar, Mourad
    Yalaoui, Farouk
    Theoretical Computer Science, 2019, 796 : 154 - 168
12345