ACO algorithm for scheduling complex unrelated parallel machine

被引:1
|
作者
Liu, Guobao [1 ]
Zhu, Qiong [1 ]
Zhang, Jie [1 ]
机构
[1] Shanghai Jiao Tong Univ, Inst Comp Integrated Mfg, Shanghai 200240, Peoples R China
来源
关键词
unrelated parallel machine scheduling; sequence-dependent setup times; precedence; makespan; Ant Colony Optimization;
D O I
10.4028/www.scientific.net/AMR.268-270.297
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
This paper addresses an unrelated parallel machine scheduling problem with job sequence-dependent setup times. Jobs have precedence constraints. The objective is to minimize the makespan. The problem has applications in industries such as TFT-LCD, textile manufactures. The problem is NP-hard in strong sense. Therefore, an Ant Colony Optimization (ACO) algorithm is introduced to solve this NP-hard problem. The proposed ACO tackles the special structure of the problem. Its performance is evaluated by comparing its solutions with Cplex method. The results show that ACO outperformed the Cplex method.
引用
收藏
页码:297 / 302
页数:6
相关论文
共 50 条
  • [41] Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost
    Li, Kai
    Xie, Fulong
    Chen, Jianfu
    Xiao, Wei
    Zhou, Tao
    OR SPECTRUM, 2025, 47 (01) : 129 - 176
  • [42] Estimation of distribution evolution memetic algorithm for the unrelated parallel-machine green scheduling problem
    Xue, Yue
    Rui, Zhijian
    Yu, Xianyu
    Sang, Xiuzhi
    Liu, Wenjie
    MEMETIC COMPUTING, 2019, 11 (04) : 423 - 437
  • [43] A Hybrid Genetic Algorithm to Minimize Total Tardiness for Unrelated Parallel Machine Scheduling with Precedence Constraints
    Liu, Chunfeng
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [44] Estimation of distribution evolution memetic algorithm for the unrelated parallel-machine green scheduling problem
    Yue Xue
    Zhijian Rui
    Xianyu Yu
    Xiuzhi Sang
    Wenjie Liu
    Memetic Computing, 2019, 11 : 423 - 437
  • [45] A Pareto evolutionary algorithm approach to bi-objective unrelated parallel machine scheduling problems
    Chiuh-Cheng Chyu
    Wei-Shung Chang
    The International Journal of Advanced Manufacturing Technology, 2010, 49 : 697 - 708
  • [46] A Pareto evolutionary algorithm approach to bi-objective unrelated parallel machine scheduling problems
    Chyu, Chiuh-Cheng
    Chang, Wei-Shung
    INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2010, 49 (5-8): : 697 - 708
  • [47] An Improved Line-Up Competition Algorithm for Unrelated Parallel Machine Scheduling with Setup Times
    Xu, Yuting
    Shi, Bin
    PROCESSES, 2022, 10 (12)
  • [48] A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
    Abdoul Bitar
    Stéphane Dauzère-Pérès
    Claude Yugma
    Renaud Roussel
    Journal of Scheduling, 2016, 19 : 367 - 376
  • [49] A memetic algorithm to solve an unrelated parallel machine scheduling problem with auxiliary resources in semiconductor manufacturing
    Bitar, Abdoul
    Dauzere-Peres, Stephane
    Yugma, Claude
    Roussel, Renaud
    JOURNAL OF SCHEDULING, 2016, 19 (04) : 367 - 376
  • [50] A PARALLEL ALGORITHM FOR THE MACHINE SCHEDULING PROBLEM
    NAKAMORI, M
    LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1988, 113 : 299 - 306