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 条
  • [31] Solution for non-permutation flow shop scheduling with buffers and machine availability constraints
    Zheng, Yong-Qian
    Li, Yan
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2014, 35 (09): : 1329 - 1334
  • [32] On the optimality conditions of the two-machine flow shop problem
    Hadda, Hatem
    Dridi, Najoua
    Hajji, Mohamed Karim
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 266 (02) : 426 - 435
  • [33] The two-machine flow shop problem with conflict graphs
    Tellache, Nour El Houda
    Boudhar, Mourad
    IFAC PAPERSONLINE, 2016, 49 (12): : 1026 - 1031
  • [34] A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint
    Breit, J
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (08) : 2143 - 2153
  • [35] Fuzzy job shop scheduling problem with availability constraints
    Lei, Deming
    COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 58 (04) : 610 - 617
  • [36] An improved approximation algorithm for the two-machine open shop scheduling problem with family setup times
    Billaut, Jean-Charles
    Gribkovskaia, Irina
    Strusevich, Vitaly
    IIE TRANSACTIONS, 2008, 40 (04) : 478 - 493
  • [37] Multiobjective flow shop scheduling problem model and algorithm with machine deterioration
    College of Information Science and Engineering, Northeastern University, State Key Laboratory of Synthetical Automation for Process Industries, Shenyang
    110819, China
    不详
    266071, China
    Xitong Gongcheng Lilum yu Shijian, 1600, 11 (2941-2950):
  • [38] A TWO-STAGE FLOW SHOP SCHEDULING WITH A CRITICAL MACHINE AND BATCH AVAILABILITY
    Gerstl, Enrique
    Mosheiov, Gur
    FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2012, 37 (01) : 39 - 56
  • [39] Improved immune Genetic Algorithm for solving flow shop scheduling problem
    Liu, M.
    Pang, W.
    Wang, K. P.
    Song, Y. Z.
    Zhou, C. G.
    COMPUTATIONAL METHODS, PTS 1 AND 2, 2006, : 1057 - +
  • [40] Improved Hormone Algorithm for Solving the Permutation Flow Shop Scheduling Problem
    Zheng K.
    Lian Z.
    Wang Y.
    Zhu C.
    Gu X.
    Liu X.
    Dianzi Keji Daxue Xuebao/Journal of the University of Electronic Science and Technology of China, 2022, 51 (06): : 890 - 903
12345