A hybrid genetic algorithm for solving no-wait flowshop scheduling problems

被引：37
|
作者：
Jarboui, Bassem [2 ]
Eddaly, Mansour [2 ]
Siarry, Patrick [1 ]
机构：
[1] Univ Paris 12, LiSSi, F-94010 Creteil, France
[2] FSEGS, Sfax 3018, Tunisia
来源：
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY | 2011年 / 54卷 / 9-12期
关键词：
No-wait flowshop; Genetic algorithm; Variable Neighborhood Search; Makespan; VARIABLE NEIGHBORHOOD SEARCH; PARTICLE SWARM OPTIMIZATION; HEURISTIC ALGORITHMS; TOTAL FLOWTIME; M-MACHINE; MINIMIZE; SHOP; MAKESPAN; TARDINESS;
D O I：
10.1007/s00170-010-3009-4
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
A hybrid genetic algorithm is proposed in this paper to minimize the makespan and the total flowtime in the no-wait flowshop scheduling problem, which is known to be NP-hard for more than two machines. The Variable Neighborhood Search is used as an improvement procedure in the last step of the genetic algorithm. First, comparisons are provided with respect to several techniques that are representative of the previous works in the area. Then, we compare the results given by three proposed algorithms. For the makespan criterion as well as for the total flowtime, the computational results show that our algorithms are able to provide competitive results and new best upper bounds.
引用
收藏
页码：1129 / 1143
页数：15
相关论文
共 50 条
  • [21] Scheduling of No-wait Stochastic Distributed Assembly Flowshop by Hybrid PSO
    Ji, Mengchen
    Yang, Yixin
    Duan, Wenzhe
    Wang, Shouyang
    Liu, Bo
    2016 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2016, : 2649 - 2654
  • [22] Minimizing makespan for a no-wait flowshop using genetic algorithm
    IMRAN ALI CHAUDHRY
    ABDUL MUNEM KHAN
    Sadhana, 2012, 37 : 695 - 707
  • [23] Intelligent Valid Inequalities for No-Wait Permutation Flowshop Scheduling Problems
    Yuksel, Damla
    Kandiller, Levent
    Tasgetiren, Mehmet Fatih
    INTELLIGENT AND FUZZY SYSTEMS: DIGITAL ACCELERATION AND THE NEW NORMAL, INFUS 2022, VOL 1, 2022, 504 : 914 - 922
  • [24] Strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
    Ben Gurion Univ of the Negev, Beer-Sheva, Israel
    Oper Res Lett, 4 (171-179):
  • [25] A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
    Kats, V
    Levner, E
    OPERATIONS RESEARCH LETTERS, 1997, 21 (04) : 171 - 179
  • [26] Properties of two-machine no-wait flowshop scheduling problems
    Chen, Ke-Jia
    Wang, Xiao
    Kongzhi yu Juece/Control and Decision, 2013, 28 (10): : 1502 - 1506
  • [27] Scheduling a No-Wait Hybrid Flowshop in a Real-Time Environment
    Xuan Hua
    PROCEEDINGS OF THE 15TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS A-C, 2008, : 375 - 378
  • [28] HEURISTIC ALGORITHMS FOR SCHEDULING IN THE NO-WAIT FLOWSHOP
    GANGADHARAN, R
    RAJENDRAN, C
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1993, 32 (03) : 285 - 290
  • [29] A hybrid genetic algorithm for optimization problems in flowshop scheduling
    Wu Jingjing
    Xu Kelin
    Kong Qinghua
    Jiang Wenxian
    PROCEEDINGS OF THE 14TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT, VOLS A AND B: BUILDING CORE COMPETENCIES THROUGH IE&EM, 2007, : 38 - 43
  • [30] Hybrid Genetic-VNS algorithm with total flowtime minimization for the no-wait flowshop problem
    Yang, Ning
    Li, Xiao-Ping
    Zhu, Jie
    Wang, Qian
    PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 935 - +
12345