An improved algorithm for the two machine flow shop problem with several availability constraints

被引：3
|
作者：
Hadda, Hatem [1 ]
机构：
[1] Ctr Urbain Nord, INSAT Tunis, Unite Rech URAII, Tunis 1080, Tunisia
来源：
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH | 2010年 / 8卷 / 03期
关键词：
Flow shop scheduling; Availability constraint; Heuristics; Worst case analysis; Polynomially solvable case; 2-MACHINE FLOWSHOP;
D O I：
10.1007/s10288-010-0119-7
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper we deal with the two-machine flow shop scheduling problem with several availability constraints on the first machine, under the resumable scenario. We first develop an improved algorithm with a relative worst-case error bound of 4/3. We then present a polynomially solvable case.
引用
收藏
页码：271 / 280
页数：10
相关论文
共 50 条
  • [21] A two-machine permutation flow shop scheduling problem with buffers
    Smutnicki, C
    OR SPEKTRUM, 1998, 20 (04) : 229 - 235
  • [22] Inverse scheduling: two-machine flow-shop problem
    Peter Brucker
    Natalia V. Shakhlevich
    Journal of Scheduling, 2011, 14 : 239 - 256
  • [23] The two-machine total completion time flow shop problem
    DellaCroce, F
    Narayan, V
    Tadei, R
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 90 (02) : 227 - 237
  • [24] 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
  • [25] An Improved Biogeography-Based Optimization Algorithm for Flow Shop Scheduling Problem
    Huang, Ming
    Shi, Shasha
    Liang, Xu
    Jiao, Xuan
    Fu, Yijie
    2020 IEEE 8TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT), 2020, : 59 - 63
  • [26] A two-machine no-wait flow shop problem with two competing agents
    Abdennour Azerine
    Mourad Boudhar
    Djamal Rebaine
    Journal of Combinatorial Optimization, 2022, 43 : 168 - 199
  • [27] A two-machine no-wait flow shop problem with two competing agents
    Azerine, Abdennour
    Boudhar, Mourad
    Rebaine, Djamal
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2022, 43 (01) : 168 - 199
  • [28] Non-preemptive two-machine open shop scheduling with non-availability constraints
    J. Breit
    G. Schmidt
    V. A. Strusevich
    Mathematical Methods of Operations Research, 2003, 57 : 217 - 234
  • [29] Non-preemptive two-machine open shop scheduling with non-availability constraints
    Breit, J
    Schmidt, G
    Strusevich, VA
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2003, 57 (02) : 217 - 234
  • [30] Minimizing total flow time for the non-permutation flow shop scheduling problem with learning effects and availability constraints
    Vahedi-Nouri, Behdin
    Fattahi, Parviz
    Ramezanian, Reza
    JOURNAL OF MANUFACTURING SYSTEMS, 2013, 32 (01) : 167 - 173
12345