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 条
  • [21] A multi-objective electromagnetism algorithm for a bi-objective hybrid no-wait flowshop scheduling problem
    Majid Khalili
    The International Journal of Advanced Manufacturing Technology, 2014, 70 : 1591 - 1601
  • [22] A Heuristic for Two-Stage No-Wait Hybrid Flowshop Scheduling with a Single Machine in Either Stage
    刘志新
    谢金星
    李建国
    董杰方
    Tsinghua Science and Technology, 2003, (01) : 43 - 48
  • [23] A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem
    Haoran, Li
    Xinyu, Li
    Liang, Gao
    APPLIED SOFT COMPUTING, 2021, 100
  • [24] No-wait flowshop scheduling problem to minimize the number of tardy jobs
    Tariq A. Aldowaisan
    Ali Allahverdi
    The International Journal of Advanced Manufacturing Technology, 2012, 61 : 311 - 323
  • [25] No-wait flowshop scheduling problem to minimize the number of tardy jobs
    Aldowaisan, Tariq A.
    Allahverdi, Ali
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 61 (1-4): : 311 - 323
  • [26] No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem
    Mucha, Marcin
    Sviridenko, Maxim
    MATHEMATICS OF OPERATIONS RESEARCH, 2016, 41 (01) : 247 - 254
  • [27] Solving Re-entrant No-wait Flowshop Scheduling Problem
    Hassanpour, S. Tasouji
    Amin-Naseri, M. R.
    Nahavandi, N.
    INTERNATIONAL JOURNAL OF ENGINEERING, 2015, 28 (06): : 903 - 912
  • [28] Minimizing makespan for solving the distributed no-wait flowshop scheduling problem
    Lin, Shih-Wei
    Ying, Kuo-Ching
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 99 : 202 - 209
  • [29] A discrete differential evolution algorithm for the no-wait flowshop scheduling problem with total flowtime criterion
    Tasgetiren, M. Fatih
    Pan, Quan-Ke
    Suganthan, P. N.
    Liang, Yun-Chia
    2007 IEEE SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN SCHEDULING, 2007, : 251 - +
  • [30] A Novel Block-shifting Simulated Annealing Algorithm for the No-wait Flowshop Scheduling Problem
    Ding, Jian-Ya
    Song, Shiji
    Zhang, Rui
    Zhou, Siwei
    Wu, Cheng
    2015 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2015, : 2768 - 2774
12345