An improved Ant Colony Optimization Algorithm for Permutation Flowshop Scheduling to Minimize Makespan

被引：0
|
作者：
Zhang, Zhiqiang [1 ]
Jing, Zhang [1 ]
机构：
[1] Xian Univ Technol, Fac Comp Sci & Engn, Xian, Peoples R China
来源：
2012 13TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING, APPLICATIONS, AND TECHNOLOGIES (PDCAT 2012) | 2012年
关键词：
Permutation Flowshop Scheduling Problem; makespan; Ant Colony Optimization; Local Search; SEQUENCING PROBLEM; GENETIC ALGORITHM;
D O I：
10.1109/PDCAT.2012.48
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
An improved Ant Colony Optimization (ACO) algorithm is put forward in this paper, with the aim of solving Permutation Flowshop Scheduling Problem (PFSP), which takes the minimum of makespan as objective function. Also, we integrate NEH heuristic with ACO for scheduling problem cooperatively, define the heuristic information of ACO via makespan increment, and come up with a new priority rule for PFSP. A local search procedure based on insertion neighborhood of PFSP is introduced into our algorithm to avoid a local optimum and to improve solution quality. Experiment results show that the proposed algorithm is effective and competitive.
引用
下载
收藏
页码：605 / 609
页数：5
相关论文
共 50 条
  • [1] Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs
    Rajendran, C
    Ziegler, H
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 155 (02) : 426 - 438
  • [2] A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan
    Lian, Zhigang
    Gu, Xingsheng
    Jiao, Bin
    APPLIED MATHEMATICS AND COMPUTATION, 2006, 175 (01) : 773 - 785
  • [3] Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan
    Rameshkumar, K
    Suresh, RK
    Mohanasundaram, KM
    ADVANCES IN NATURAL COMPUTATION, PT 3, PROCEEDINGS, 2005, 3612 : 572 - 581
  • [4] Ant Colony Optimization Algorithm to Minimize Makespan and Number of Tardy Jobs in Flexible Flowshop Systems
    Niebles Atencio, Fabricio
    Solano-Charris, Elyn L.
    Montoya-Torres, Jairo R.
    2012 XXXVIII CONFERENCIA LATINOAMERICANA EN INFORMATICA (CLEI), 2012,
  • [5] A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan
    Xu, Jianyou
    Yin, Yunqiang
    Cheng, T. C. E.
    Wu, Chin-Chia
    Gu, Shusheng
    APPLIED SOFT COMPUTING, 2014, 24 : 277 - 283
  • [6] An application of Particle Swarm Optimization Algorithm to permutation flowshop scheduling problems to minimize makespan, total flowtime and completion time variance
    Chandrasekaran, S.
    Ponnambalam, S. G.
    Suresh, R. K.
    Vijayakumar, N.
    2006 IEEE INTERNATIONAL CONFERENCE ON AUTOMATION SCIENCE AND ENGINEERING, VOLS 1 AND 2, 2006, : 513 - +
  • [7] Concurrent flowshop scheduling to minimize makespan
    Koulamas, C
    Kyparisis, GJ
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 156 (02) : 524 - 529
  • [8] Minimize makespan of permutation flowshop using pointer network
    Cho, Young In
    Nam, So Hyun
    Cho, Ki Young
    Yoon, Hee Chang
    Woo, Jong Hun
    JOURNAL OF COMPUTATIONAL DESIGN AND ENGINEERING, 2022, 9 (01) : 51 - 67
  • [9] A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
    Wang, Cheng
    Song, Shiji
    Gupta, Jatinder N. D.
    Wu, Cheng
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (11) : 2880 - 2887
  • [10] Ant colony optimization based algorithm for permutation flow shop scheduling
    Liu, Yan-Feng
    Liu, San-Yang
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2008, 30 (09): : 1690 - 1692
12345