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
关键词
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 条
  • [1] An Effective Hybrid Algorithm for Permutation Flow Shop Scheduling Problem with Setup Time
    Peng, Kunkun
    Wen, Long
    Li, Ran
    Gao, Liang
    Li, Xinyu
    [J]. 51ST CIRP CONFERENCE ON MANUFACTURING SYSTEMS, 2018, 72 : 1288 - 1292
  • [2] Flow-shop scheduling with setup and assembly operations
    Yokoyama, Masao
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 187 (03) : 1184 - 1195
  • [3] A modified branch and bound algorithm for a vague flow-shop scheduling problem
    Gholizadeh, H.
    Fazlollahtabar, H.
    Gholizadeh, R.
    [J]. IRANIAN JOURNAL OF FUZZY SYSTEMS, 2019, 16 (04): : 55 - 64
  • [4] Hybrid Flow Shop with Setup Times Scheduling Problem
    Jemmali, Mahdi
    Hidri, Lotfi
    [J]. COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2023, 44 (01): : 563 - 577
  • [5] Teaching-learning-based optimization algorithm for hybrid flow shop scheduling problem with assembly operations
    Xu, Zhiwei
    Lei, Deming
    [J]. PROCEEDINGS OF THE 30TH CHINESE CONTROL AND DECISION CONFERENCE (2018 CCDC), 2018, : 4879 - 4884
  • [6] Hybrid flow-shop scheduling with assembly operations
    Yokoyama, M
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2001, 73 (02) : 103 - 116
  • [7] Branch and Bound Method with Heuristic Algorithm for a Special Flexible Flow Shop Scheduling Problem
    Li, Zhantao
    Hong, Fu
    Chen, Qingxin
    Mao, Ning
    [J]. MANUFACTURING ENGINEERING AND AUTOMATION I, PTS 1-3, 2011, 139-141 : 1530 - +
  • [8] Fuzzy branch-and-bound algorithm for flow shop scheduling
    İzzettİn Temİz
    Serpİl Erol
    [J]. Journal of Intelligent Manufacturing, 2004, 15 : 449 - 454
  • [9] Fuzzy branch-and-bound algorithm for flow shop scheduling
    Temiz, I
    Erol, S
    [J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2004, 15 (04) : 449 - 454
  • [10] A hybrid algorithm for flow shop scheduling problem
    Zhang, Changsheng
    Sun, Jigui
    Ning, Jiaxu
    Yang, Qingyun
    [J]. 2008 PROCEEDINGS OF INFORMATION TECHNOLOGY AND ENVIRONMENTAL SYSTEM SCIENCES: ITESS 2008, VOL 1, 2008, : 182 - 188