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 条
  • [21] A HYBRID APPROACH FOR MINIMIZING MAKESPAN IN PERMUTATION FLOWSHOP SCHEDULING
    Govindan, Kannan
    Balasundaram, R.
    Baskar, N.
    Asokan, P.
    JOURNAL OF SYSTEMS SCIENCE AND SYSTEMS ENGINEERING, 2017, 26 (01) : 50 - 76
  • [22] A hybrid approach for minimizing makespan in permutation flowshop scheduling
    Kannan Govindan
    R. Balasundaram
    N. Baskar
    P. Asokan
    Journal of Systems Science and Systems Engineering, 2017, 26 : 50 - 76
  • [23] A NO-WAIT FLOWSHOP SCHEDULING HEURISTIC TO MINIMIZE MAKESPAN
    RAJENDRAN, C
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1994, 45 (04) : 472 - 478
  • [24] Scheduling the distributed assembly flowshop problem to minimize the makespan
    Ochi, Hanadi
    Driss, Olfa Belkahla
    CENTERIS2019--INTERNATIONAL CONFERENCE ON ENTERPRISE INFORMATION SYSTEMS/PROJMAN2019--INTERNATIONAL CONFERENCE ON PROJECT MANAGEMENT/HCIST2019--INTERNATIONAL CONFERENCE ON HEALTH AND SOCIAL CARE INFORMATION SYSTEMS AND TECHNOLOGIES, 2019, 164 : 471 - 477
  • [25] Analysis of antithetic sequences in flowshop scheduling to minimize makespan
    Moras, R
    Smith, ML
    Kumar, KS
    Azim, MA
    PRODUCTION PLANNING & CONTROL, 1997, 8 (08) : 780 - 787
  • [26] An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance
    Mao, Jia-yang
    Pan, Quan-ke
    Miao, Zhong-hua
    Gao, Liang
    EXPERT SYSTEMS WITH APPLICATIONS, 2021, 169
  • [27] On solving permutation scheduling problems with ant colony optimization
    Merkle, D
    Middendorf, M
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 2005, 36 (05) : 255 - 266
  • [28] Development of new features of ant colony optimization for flowshop scheduling
    Lin, B. M. T.
    Lu, C. Y.
    Shyu, S. J.
    Tsai, C. Y.
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2008, 112 (02) : 742 - 755
  • [29] An iterated greedy algorithm with optimization of partial solutions for the makespan permutation flowshop problem
    Dubois-Lacoste, Jeremie
    Pagnozzi, Federico
    Stutzle, Thomas
    COMPUTERS & OPERATIONS RESEARCH, 2017, 81 : 160 - 166
  • [30] A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion
    Bargaoui, Hafewa
    Driss, Olfa Belkahla
    Ghedira, Khaled
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 111 : 239 - 250
12345