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 条
  • [1] A dynamic programming algorithm for scheduling jobs in a two-machine open shop with an availability constraint
    Lorigeon, T
    Billaut, JC
    Bouquard, JL
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2002, 53 (11) : 1239 - 1246
  • [2] An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint
    Breit, J
    INFORMATION PROCESSING LETTERS, 2004, 90 (06) : 273 - 278
  • [3] Stochastic scheduling for a two-machine open shop
    Righter, R
    JOURNAL OF APPLIED PROBABILITY, 1997, 34 (03) : 733 - 744
  • [4] An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
    Hatem Hadda
    Najoua Dridi
    Sonia Hajri-Gabouj
    4OR, 2010, 8 : 87 - 99
  • [5] Mixed Integer Programming Formulations for Two-Machine Flow Shop Scheduling with an Availability Constraint
    Xu, Zhijun
    Xu, Dehua
    He, Jie
    Wang, Qi
    Liu, Aihua
    Xiao, Junfang
    ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2018, 43 (02) : 777 - 788
  • [6] Mixed Integer Programming Formulations for Two-Machine Flow Shop Scheduling with an Availability Constraint
    Zhijun Xu
    Dehua Xu
    Jie He
    Qi Wang
    Aihua Liu
    Junfang Xiao
    Arabian Journal for Science and Engineering, 2018, 43 : 777 - 788
  • [7] An improved heuristic for two-machine flow shop scheduling with an availability constraint and nonresumable jobs
    Hadda, Hatem
    Dridi, Najoua
    Hajri-Gabouj, Sonia
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2010, 8 (01): : 87 - 99
  • [8] Two-agent scheduling in a two-machine open shop
    Liu, Peihai
    Gu, Manzhan
    Lu, Xiwen
    ANNALS OF OPERATIONS RESEARCH, 2024, 333 (01) : 275 - 301
  • [9] Two-agent scheduling in a two-machine open shop
    Peihai Liu
    Manzhan Gu
    Xiwen Lu
    Annals of Operations Research, 2024, 333 : 275 - 301
  • [10] An improved heuristic for two-machine flowshop scheduling with an availability constraint
    Cheng, TEC
    Wang, GQ
    OPERATIONS RESEARCH LETTERS, 2000, 26 (05) : 223 - 229
12345