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 条
  • [41] An improved algorithm for a hybrid flow-shop problem in graphics processing
    Jiang Y.-W.
    Wei Q.
    Zidonghua Xuebao/Acta Automatica Sinica, 2011, 37 (11): : 1381 - 1386
  • [42] An Improved Quantum Differential Algorithm for Stochastic Flow Shop Scheduling Problem
    Jiao, Bin
    Gu, Xingsheng
    Cu, Jinwei
    2009 IEEE INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION, VOLS 1-3, 2009, : 1235 - +
  • [43] A Genetic Algorithm to Minimize the Makespan in a Two-Machine Cross-Docking Flow Shop Problem
    Hamdi, Imen
    Tekaya, Mohamed Fadhel
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2020, 8 (03) : 457 - 476
  • [44] A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
    Ng, C. T.
    Wang, J. -B.
    Cheng, T. C. E.
    Liu, L. L.
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (01) : 83 - 90
  • [45] A branch-and-bound algorithm for the two-machine flow-shop problem with time delays
    Mkadem, Mohamed Amine
    Moukrim, Aziz
    Serairi, Mehdi
    2017 4TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2017, : 690 - 695
  • [46] Improved iterated greedy algorithm for reentrant flow shop scheduling problem
    Wu, Xiuli
    Li, Yuxin
    Kuang, Yuan
    Cui, Jianjie
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2024, 30 (07): : 2364 - 2380
  • [47] A Genetic Algorithm to Minimize the Makespan in a Two-Machine Cross-Docking Flow Shop Problem
    Imen Hamdi
    Mohamed Fadhel Tekaya
    Journal of the Operations Research Society of China, 2020, 8 : 457 - 476
  • [48] An Enumeration Algorithm for the No-Wait Flow Shop Problem with Due Date Constraints
    Samarghandi, Hamed
    Behroozi, Mehdi
    IFAC PAPERSONLINE, 2016, 49 (12): : 1803 - 1808
  • [49] Two-machine job shop problem for makespan minimization under availability constraint
    Benttaleb, Mourad
    Hnaien, Faicel
    Yalaoui, Farouk
    IFAC PAPERSONLINE, 2016, 49 (28): : 132 - 137
  • [50] Two-machine flow shop scheduling problem with an outsourcing option
    Choi, Byung-Cheon
    Chung, Jibok
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 213 (01) : 66 - 72
12345