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] 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
  • [22] An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
    Sadfi, C
    Penz, B
    Rapine, C
    Blazewicz, J
    Formanowicz, P
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 161 (01) : 3 - 10
  • [23] Scheduling two-stage hybrid flow shop with availability constraints
    Allaoui, H
    Artiba, A
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (05) : 1399 - 1419
  • [24] Flow shop scheduling problem with limited machine availability: A heuristic approach
    Aggoune, R
    Portmann, MC
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2006, 99 (1-2) : 4 - 15
  • [25] Quasicomplete factorization and the two machine flow shop problem
    Bart, H
    Kroon, L
    Zuidwijk, R
    LINEAR ALGEBRA AND ITS APPLICATIONS, 1998, 278 (1-3) : 195 - 219
  • [26] Scheduling hybrid flow shop problem with non-fixed availability constraints
    Besbes, Walid
    Teghem, Jacques
    Loukil, Taiecir
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2010, 4 (04) : 413 - 433
  • [27] A Computational Study of the Two-Machine No-Wait Flow Shop Scheduling Problem Subject to Unequal Release Dates and Non-Availability Constraints
    Labidi, Mohamed
    Kooli, Anis
    Ladhari, Talel
    Gharbi, Anis
    Suryahatmaja, Umar S.
    IEEE ACCESS, 2018, 6 : 16294 - 16304
  • [28] An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
    Agnetis, A
    Rossi, F
    Gristina, G
    NAVAL RESEARCH LOGISTICS, 1998, 45 (02) : 141 - 164
  • [29] A Mathematical Model and a Firefly Algorithm for an Extended Flexible Job Shop Problem with Availability Constraints
    Lunardi, Willian Tessaro
    Cherri, Luiz Henrique
    Voos, Holger
    ARTIFICIAL INTELLIGENCE AND SOFT COMPUTING, ICAISC 2018, PT I, 2018, 10841 : 548 - 560
  • [30] Flexible flow shop with sequence-dependent setup times and machine availability constraints
    Javadian, Nikbakhsh
    Amiri-Aref, Mehdi
    Hadighi, Ali
    Kazemi, Mohammad
    Moradi, Alireza
    INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2010, 5 (03) : 219 - 226
12345