Flexible open shop scheduling problem to minimize makespan

被引：43
作者：
Bai, Danyu [1 ,2 ]
Zhang, Zhi-Hai [2 ]
Zhang, Qiang [3 ]
机构：
[1] Shenyang Univ Chem Technol, Sch Econ & Management, Shenyang 110142, Peoples R China
[2] Tsinghua Univ, Dept Ind Engn, Beijing 100084, Peoples R China
[3] Northeastern Univ, Software Coll, Shenyang 110819, Peoples R China
来源：
COMPUTERS & OPERATIONS RESEARCH | 2016年 / 67卷
基金：
中国国家自然科学基金;
关键词：
Scheduling; Flexible open shop; Makespan; Asymptotic analysis; Differential evolution algorithm; DIFFERENTIAL EVOLUTION ALGORITHM; MULTIPROCESSOR OPEN SHOP; PARALLEL MACHINES; SETUP TIMES;
D O I：
10.1016/j.cor.2015.10.012
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This study investigates the static and dynamic versions of the flexible open shop scheduling problem with the goal of minimizing makespan. The asymptotic optimality of the general dense scheduling (GDS) algorithm is proven by the boundedness hypothesis. For large-scale problems, the GDS-based heuristic algorithms are presented to accelerate convergence. For moderate-scale problems, the differential evolution algorithm is employed to obtain high-quality solutions. A series of random experiments are conducted to demonstrate the effectiveness of the proposed algorithms. (C) 2015 Elsevier Ltd. All rights reserved.
引用
收藏
页码：207 / 215
页数：9
相关论文
共 50 条
  • [1] Open shop scheduling problem to minimize makespan with release dates
    Bai, Danyu
    Tang, Lixin
    APPLIED MATHEMATICAL MODELLING, 2013, 37 (04) : 2008 - 2015
  • [2] Four decades of research on the open-shop scheduling problem to minimize the makespan
    Ahmadian, Mohammad Mahdi
    Khatami, Mostafa
    Salehipour, Amir
    Cheng, T. C. E.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 295 (02) : 399 - 426
  • [3] Two-Stage Flow-Open Shop Scheduling Problem to Minimize Makespan
    Ren, Tao
    Liu, Bingqian
    Zhao, Peng
    Yuan, Huawei
    Li, Haiyan
    Bai, Danyu
    INTELLIGENT COMPUTING THEORIES AND APPLICATION, ICIC 2016, PT I, 2016, 9771 : 527 - 535
  • [4] Scheduling Flexible Flow Shop in Labeling Companies to Minimize the Makespan
    Wang, Chia-Nan
    Hsu, Hsien-Pin
    Fu, Hsin-Pin
    Nguyen Ky Phuc Phan
    Van Thanh Nguyen
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2022, 40 (01): : 17 - 36
  • [5] A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem
    Ahmadizar, Fardin
    Barzinpour, Farnaz
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2010, 3 (06) : 853 - 861
  • [6] New heuristics for flow shop problem to minimize makespan
    Bai, D.
    Tang, L.
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2010, 61 (06) : 1032 - 1040
  • [7] Two-machine open-shop scheduling with rejection to minimize the makespan
    Liqi Zhang
    Lingfa Lu
    Jinjiang Yuan
    OR Spectrum, 2016, 38 : 519 - 529
  • [8] Two-machine open-shop scheduling with rejection to minimize the makespan
    Zhang, Liqi
    Lu, Lingfa
    Yuan, Jinjiang
    OR SPECTRUM, 2016, 38 (02) : 519 - 529
  • [9] Open shop scheduling problem to minimize total weighted completion time
    Bai, Danyu
    Zhang, Zhihai
    Zhang, Qiang
    Tang, Mengqian
    ENGINEERING OPTIMIZATION, 2017, 49 (01) : 98 - 112
  • [10] Scheduling of a hub reentrant job shop to minimize makespan
    Xie, Xie
    Tang, Lixin
    Li, Yanping
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2011, 56 (5-8) : 743 - 753
12345