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 条
  • [1] A hybrid genetic algorithm for solving no-wait flowshop scheduling problems
    Bassem Jarboui
    Mansour Eddaly
    Patrick Siarry
    The International Journal of Advanced Manufacturing Technology, 2011, 54 : 1129 - 1143
  • [2] A hybrid genetic algorithm for no-wait flowshop scheduling problem
    Tseng, Lin-Yu
    Lin, Ya-Tai
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2010, 128 (01) : 144 - 152
  • [3] A hybrid heuristic algorithm for the no-wait flowshop scheduling problem
    Riahi, Vahid
    Kazemi, Morteza
    CSSE 2015 20th International Symposium on Computer Science and Software Engineering, 2015,
  • [4] A Heuristic Genetic Algorithm for No-Wait Flowshop Scheduling Problem
    CHANG Jun-lin
    International Journal of Mining Science and Technology, 2007, (04) : 582 - 586
  • [5] A hybrid genetic algorithm for no-wait job shop scheduling problems
    Pan, Jason Chao-Hsien
    Huang, Han-Chiang
    EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (03) : 5800 - 5806
  • [6] A HYBRID LOCAL SEARCH ALGORITHM FOR NO-WAIT FLOWSHOP SCHEDULING PROBLEM
    Wang, Jing
    Li, Tieke
    Zhang, Wenxue
    ICIM 2008: PROCEEDINGS OF THE NINTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2008, : 157 - 163
  • [7] A new hybrid ant colony algorithm for scheduling of no-wait flowshop
    Riahi, Vahid
    Kazemi, Morteza
    OPERATIONAL RESEARCH, 2018, 18 (01) : 55 - 74
  • [8] Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling
    Filho, Geraldo Ribeiro
    Nagano, Marcelo Seido
    Lorena, Luiz Antonio Nogueira
    MICAI 2007: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2007, 4827 : 1099 - +
  • [9] A new hybrid ant colony algorithm for scheduling of no-wait flowshop
    Vahid Riahi
    Morteza Kazemi
    Operational Research, 2018, 18 : 55 - 74
  • [10] Genetic Algorithm to minimize flowtime in a no-wait flowshop scheduling problem
    Chaudhry, Imran A.
    Ahmed, Riaz
    Khan, Abdul Munem
    27TH INTERNATIONAL CONFERENCE ON CADCAM, ROBOTICS AND FACTORIES OF THE FUTURE 2014, 2014, 65
12345