A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations

被引：72
|
作者：
Fattahi, Parviz [1 ]
Hosseini, Seyed Mohammad Hassan [2 ]
Jolai, Fariborz [3 ]
Tavakkoli-Moghaddam, Reza [3 ]
机构：
[1] Bu Ali Sina Univ, Dept Ind Engn, Hamadan, Iran
[2] Payame Noor Univ, Dept Ind Engn, Tehran, Iran
[3] Univ Tehran, Dept Ind Engn, Tehran, Iran
来源：
APPLIED MATHEMATICAL MODELLING | 2014年 / 38卷 / 01期
关键词：
Scheduling; Hybrid flow shop; Assembly; Branch and bound; Setup time; PARALLEL MACHINES; COMPLETION TIMES; TOTAL TARDINESS; MINIMIZE; MAKESPAN; HEURISTICS; 3-MACHINE; SYSTEM; GRASP; SUM;
D O I：
10.1016/j.apm.2013.06.005
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
A hybrid flow shop scheduling problem (HFSP) with assembly operations is studied in this paper. In the considered problem, a number of products of the same kind are produced. Each product is assembled using a set of several parts. At first, the parts are produced in a hybrid flow shop and then they are assembled in an assembly stage to produce products. The considered objective is to minimize the completion time of all products (makespan). This problem has been proved strongly NP-hard, so in order to solve it, a hierarchical branch and bound algorithm is presented. Also, some lower and upper bounds are developed to increase the efficiency of the proposed algorithm. The numerical experiments are used to evaluate the performance of the proposed algorithm. (C) 2013 Elsevier Inc. All rights reserved.
引用
收藏
页码：119 / 134
页数：16
相关论文
共 50 条
  • [21] A Genetic Algorithm for Flow Shop Scheduling with Assembly Operations to Minimize Makespan
    Bhongade A.S.
    Khodke P.M.
    [J]. Bhongade, A.S. (ajay_bhongade@rediffmail.com), 1600, Springer (95): : 89 - 96
  • [22] A Flow Shop Scheduling Problem with Transportation Time and Separated Setup Time of Jobs
    Agrawal, S.
    Gautam, A.
    Chauhan, D. K.
    Tiwari, L. M.
    Kapoor, S.
    [J]. INTERNATIONAL CONFERENCE ON MODELLING OPTIMIZATION AND COMPUTING, 2012, 38 : 1327 - 1332
  • [23] An improved branch-and-bound algorithm for the preemptive open shop total completion time scheduling problem
    Liaw, Ching-Fang
    [J]. JOURNAL OF INDUSTRIAL AND PRODUCTION ENGINEERING, 2013, 30 (05) : 327 - 335
  • [24] A branch and bound procedure for the reentrant permutation flow-shop scheduling problem
    Chen, Jen-Shiang
    [J]. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2006, 29 (11-12): : 1186 - 1193
  • [25] A branch and bound procedure for the reentrant permutation flow-shop scheduling problem
    Jen-Shiang Chen
    [J]. The International Journal of Advanced Manufacturing Technology, 2006, 29 : 1186 - 1193
  • [26] A branch and bound procedure for the reentrant permutation flow-shop scheduling problem
    Chen, Jen-Shiang
    [J]. International Journal of Advanced Manufacturing Technology, 2006, 29 (11-12): : 1186 - 1193
  • [27] A branch and bound algorithm for the two-stage assembly scheduling problem
    Hariri, AMA
    Potts, CN
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 103 (03) : 547 - 556
  • [28] Efficient heuristics for the hybrid flow shop scheduling problem with missing operations
    Dios, Manuel
    Fernandez-Viagas, Victor
    Framinan, Jose M.
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 115 : 88 - 99
  • [29] A Hybrid Iterative Greedy Optimization Algorithm for Distributed Assembly Blocking Flow Shop Scheduling Problem
    Zheng, Yongqi
    [J]. International Journal of Network Security, 2022, 24 (06): : 984 - 993
  • [30] A hybrid genetic algorithm for the hybrid flow shop scheduling problem with machine blocking and sequence-dependent setup times
    Ferreira Maciel, Ingrid Simoes
    Prata, Bruno de Athayde
    Nagano, Marcelo Seido
    de Abreu, Levi Ribeiro
    [J]. JOURNAL OF PROJECT MANAGEMENT, 2022, : 201 - 216
12345