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 条
  • [41] A Discrete Artificial Bee Colony Algorithm for the Energy-Efficient No-Wait Flowshop Scheduling Problem
    Tasgetiren, M. Fatih
    Yuksel, Damla
    Gao, Liang
    Pan, Quan-Ke
    Li, Peigen
    [J]. 25TH INTERNATIONAL CONFERENCE ON PRODUCTION RESEARCH MANUFACTURING INNOVATION: CYBER PHYSICAL MANUFACTURING, 2019, 39 : 1223 - 1231
  • [42] Fast Iterated Local Search Algorithm with High Order Neighborhood for No-wait Flowshop Scheduling Problem
    Wang, Chuyang
    [J]. 26TH CHINESE CONTROL AND DECISION CONFERENCE (2014 CCDC), 2014, : 4460 - 4464
  • [43] A branch-and-cut approach for the distributed no-wait flowshop scheduling problem
    Avci, Mustafa
    Avci, Mualla Gonca
    Hamzadayi, Alper
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2022, 148
  • [44] No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
    Allahverdi, Ali
    Aydilek, Harun
    Aydilek, Asiye
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (02) : 590 - 601
  • [45] A Cooperative Algorithm for Energy-efficient Scheduling of Distributed No-wait Flowshop
    Wang, Jingjing
    Wang, Ling
    Wu, Chuge
    Shen, Jingnan
    [J]. 2017 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (SSCI), 2017,
  • [46] An Effective Heuristic for the No-Wait Flowshop with Sequence-Dependent Setup Times Problem
    Araujo, Daniella Castro
    Nagano, Marcelo Seido
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE, MICAI 2010, PT I, 2010, 6437 : 187 - 196
  • [47] On Eulerian extensions and their application to no-wait flowshop scheduling
    Wiebke Höhn
    Tobias Jacobs
    Nicole Megow
    [J]. Journal of Scheduling, 2012, 15 : 295 - 309
  • [48] FUNCTIONAL HEURISTIC ALGORITHM FOR FLOWSHOP SCHEDULING PROBLEM
    GUPTA, JND
    [J]. OPERATIONAL RESEARCH QUARTERLY, 1971, 22 (01) : 39 - &
  • [49] On Eulerian extensions and their application to no-wait flowshop scheduling
    Hoehn, Wiebke
    Jacobs, Tobias
    Megow, Nicole
    [J]. JOURNAL OF SCHEDULING, 2012, 15 (03) : 295 - 309
  • [50] A new hybrid genetic algorithm for the bi-criteria no-wait flowshop scheduling problem with makespan and total flow time minimization
    Liu, You-Gen
    Zhu, Xia
    Li, Xiao-Ping
    [J]. PROCEEDINGS OF 2008 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2008, : 883 - +
12345