An approximation algorithm for proportionate scheduling in the two-stage hybrid flow shop

被引:3
|
作者
Dong, Jianming [1 ]
Jiang, Yiwei [1 ]
Zhang, An [2 ]
Hu, Jueliang [1 ]
Luo, Hui [1 ]
机构
[1] Zhejiang Sci Tech Univ, Dept Math, Hangzhou 310018, Zhejiang, Peoples R China
[2] Hangzhou Dianzi Univ, Inst Operat Res & Cybernet, Hangzhou 310018, Zhejiang, Peoples R China
基金
中国国家自然科学基金;
关键词
Scheduling; Two-stage proportionate flow shop; Approximation algorithm; Worst-case analysis; MULTIPROCESSOR OPEN; MINIMIZE; FLOWSHOPS; SYSTEMS;
D O I
10.1016/j.ipl.2014.11.014
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In the hybrid flow shop, jobs are subjected to process through stages in series as in the classical flow shop, while each stage contains one or more identical machines. This paper mainly studies the scheduling problem in the two-stage hybrid flow shop, namely the proportionate scheduling. In such problem, it is assumed that each job has the same processing time in different stages. The objective of minimizing the makespan is considered. If there are two machines in the first stage and m machines in the second, then an approximation algorithm with worst case ratio no more than 3/2 is provided. If each stage consists of only two machines, we show that the tight bound of our algorithm can be reduced to 4/3. (C) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:475 / 480
页数:6
相关论文
共 50 条
  • [1] Distributed two-stage hybrid flow shop scheduling
    Zhang Q.
    Sun Z.
    Lei D.
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2020, 48 (04): : 127 - 132
  • [2] Optimal scheduling of a two-stage hybrid flow shop
    Haouari, Mohamed
    Hidri, Lotfi
    Gharbi, Anis
    MATHEMATICAL METHODS OF OPERATIONS RESEARCH, 2006, 64 (01) : 107 - 124
  • [3] Optimal Scheduling of a Two-stage Hybrid Flow Shop
    Mohamed Haouari
    Lotfi Hidri
    Anis Gharbi
    Mathematical Methods of Operations Research, 2006, 64 : 107 - 124
  • [4] An approximation scheme for heterogeneous parallel task scheduling in a two-stage hybrid flow shop
    School of Information Science and Engineering, Northeastern University, Shengyang
    110004, China
    J. Inf. Sci. Eng., 4 (1291-1308):
  • [5] Approximation algorithms for two-stage flexible flow shop scheduling
    Zhang, Minghui
    Lan, Yan
    Han, Xin
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 39 (01) : 1 - 14
  • [6] Approximation algorithms for two-stage flexible flow shop scheduling
    Minghui Zhang
    Yan Lan
    Xin Han
    Journal of Combinatorial Optimization, 2020, 39 : 1 - 14
  • [7] An Approximation Scheme for Heterogeneous Parallel Task Scheduling in a Two-Stage Hybrid Flow Shop
    Sun, Jinghao
    Meng, Yakun
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2015, 31 (04) : 1291 - 1308
  • [8] Scheduling two-stage hybrid flow shop with availability constraints
    Allaoui, H
    Artiba, A
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (05) : 1399 - 1419
  • [9] A genetic algorithm for two-stage no-wait hybrid flow shop scheduling problem
    Wang, Shijin
    Liu, Ming
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) : 1064 - 1075
  • [10] Analysis of a Heuristics for Scheduling Two-Stage Hybrid Flow Shop
    Xie, Xie
    Tang, Lixin
    INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 2, PROCEEDINGS, 2009, : 879 - 882