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 条
  • [21] Flow shop scheduling with deteriorating jobs under dominating machines to minimize makespan
    Wang, Ji-Bo
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 48 (5-8) : 719 - 723
  • [22] Using a Modified Simulated Annealing Algorithm to Minimize Makespan in a Permutation Flow-shop Scheduling Problem with Job Deterioration
    Seyed-Alagheband, S. A.
    Davoudpour, H.
    Doulabi, S. H. Hashemi
    Khatibi, M.
    WCECS 2009: WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, VOLS I AND II, 2009, : 1232 - 1237
  • [23] Mixed Integer Programming Model For Flexible Job-Shop Scheduling Problem (FJS']JSP) To Minimize Makespan And Total Machining Time
    Gran, Shirley Sinatra
    Ismail, Ismariani
    Ajol, Tracy Adeline
    Ibrahim, Abang Feizal Abang
    2015 2ND INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATIONS, AND CONTROL TECHNOLOGY (I4CT), 2015,
  • [24] A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan
    Tellache, Nour ElHouda
    Kerbache, Laoucine
    COMPUTERS & OPERATIONS RESEARCH, 2023, 156
  • [25] An effective genetic algorithm for flow shop scheduling problems to minimize makespan
    Robert, R. B. Jeen
    Rajkumar, R.
    MECHANIKA, 2017, 23 (04): : 594 - 603
  • [26] Scheduling the distributed assembly flowshop problem to minimize the makespan
    Ochi, Hanadi
    Driss, Olfa Belkahla
    CENTERIS2019--INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS/PROJMAN2019--INTERNATIONAL CONFERENCE ON PROJECT MANAGEMENT/HCIST2019--INTERNATIONAL CONFERENCE ON HEALTH AND SOCIAL CARE INFORMATION SYSTEMS AND TECHNOLOGIES, 2019, 164 : 471 - 477
  • [27] A Genetic Algorithm for Flow Shop Scheduling with Assembly Operations to Minimize Makespan
    Bhongade A.S.
    Khodke P.M.
    Bhongade, A.S. (ajay_bhongade@rediffmail.com), 1600, Springer (95): : 89 - 96
  • [28] Two-Machine Job-Shop Scheduling Problem to Minimize the Makespan with Uncertain Job Durations
    Sotskov, Yuri N.
    Matsveichuk, Natalja M.
    Hatsura, Vadzim D.
    ALGORITHMS, 2020, 13 (01)
  • [29] Two-stage proportionate flexible flow shop to minimize the makespan
    Choi, Byung-Cheon
    Lee, Kangbok
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 25 (01) : 123 - 134
  • [30] Two-stage proportionate flexible flow shop to minimize the makespan
    Byung-Cheon Choi
    Kangbok Lee
    Journal of Combinatorial Optimization, 2013, 25 : 123 - 134
12345