A hybrid heuristic algorithm for the no-wait flowshop scheduling problem

被引：0
|
作者：
Riahi, Vahid [1 ]
Kazemi, Morteza [1 ]
机构：
[1] Shiraz Univ Technol, Dept Ind Engn, Shiraz, Iran
来源：
CSSE 2015 20th International Symposium on Computer Science and Software Engineering | 2015年
关键词：
no-wait flowshop scheduling; ant colony optimization; Simulated Annealing; maximum completion time; PARTICLE SWARM OPTIMIZATION; ANT COLONY OPTIMIZATION; GENETIC ALGORITHM; MAKESPAN; MINIMIZE; MACHINE;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
the no-wait flowshop scheduling problem (NWFSP) that needs jobs to be processed without interruption between consecutive machines is a NP-hard combinatorial optimization problem, and embodies a significant area in production scheduling. The objective is set to find the scheduling which minimizes the makespan. In this paper, a new hybrid ant colony optimization (ACO) and Simulated Annealing (SA) algorithm is presented to solve NWFSP. The computational results on 29 benchmark instances provided by Carlier and Reeves and comparison with other reported results in the literature approves the efficiency of the proposed algorithm.
引用
收藏
页数：6
相关论文
共 50 条
  • [31] 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
  • [32] No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem
    Mucha, Marcin
    Sviridenko, Maxim
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 769 - 779
  • [33] 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):
  • [34] A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
    Kats, V
    Levner, E
    OPERATIONS RESEARCH LETTERS, 1997, 21 (04) : 171 - 179
  • [35] HEURISTIC ALGORITHM FOR FLOWSHOP SCHEDULING PROBLEM
    GUPTA, JND
    REVUE FRANCAISE D AUTOMATIQUE INFORMATIQUE RECHERCHE OPERATIONNELLE, 1976, 10 (06): : 63 - 73
  • [36] A Matheuristic Approach for the No-Wait Flowshop Scheduling Problem with Makespan Criterion
    Gao, Yu
    Wang, Ziyue
    Gao, Liang
    Li, Xinyu
    SYMMETRY-BASEL, 2022, 14 (05):
  • [37] 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
  • [38] A Heuristic Algorithm for Flowshop Scheduling Problem
    Tang, Dan
    Shu, Hong Ping
    MANUFACTURING ENGINEERING AND AUTOMATION II, PTS 1-3, 2012, 591-593 : 626 - 630
  • [39] Heuristic algorithm for scheduling in the no-wait flow-shop
    Bertolissi, E
    JOURNAL OF MATERIALS PROCESSING TECHNOLOGY, 2000, 107 (1-3) : 459 - 465
  • [40] 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