Solving job shop scheduling problems using artificial immune system

被引：0
|
作者：
Chandrasekaran, M. [1 ]
Asokan, P. [1 ]
Kumanan, S. [1 ]
Balamurugan, T. [1 ]
Nickolas, S. [2 ]
机构：
[1] Department of Production Engineering, National Institute of Technology, Tiruchirappalli, 620015 Tamilnadu, India
[2] Department of Computer Applications, National Institute of Technology, Tiruchirappalli, 620015 Tamilnadu, India
来源：
International Journal of Advanced Manufacturing Technology | 2006年 / 31卷 / 5-6期
关键词：
The n-job; m-machine job shop scheduling ([!text type='JS']JS[!/text]S) problem is one of the general production scheduling problems. Many existing heuristics give solutions for small size problems with near optimal solutions. This paper deals with the criterion of makespan minimization for the job shop scheduling of different size problems. The proposed computational method of artificial immune system algorithm (AIS) is used for finding optimal makespan values of different size problems. The artificial immune system algorithm is tested with 130 benchmark problems [10 (ORB1-ORB5 & ARZ5-ARZ9); 40 (LA01-LA40) and 80 (TA01-TA80)]. The results show that the AIS algorithm is an efficient and effective algorithm which gives better results than the Tabu search shifting bottleneck procedure (TSSB) as well as the best solution of shifting bottleneck procedure ( SB-GLS1 ) of Balas and Vazacopoulos. © Springer-Verlag London Limited 2006;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Journal article (JA)
引用
收藏
页码：580 / 593
相关论文
共 50 条
  • [31] INCREMENTAL METHOD BY CONSTANT TIME FOR SOLVING JOB SHOP SCHEDULING PROBLEMS
    Nishikori, Akimine
    ICIM 2010: PROCEEDINGS OF THE TENTH INTERNATIONAL CONFERENCE ON INDUSTRIAL MANAGEMENT, 2010, : 38 - 42
  • [32] Solving job shop scheduling problems via deep reinforcement learning
    Yuan, Erdong
    Cheng, Shuli
    Wang, Liejun
    Song, Shiji
    Wu, Fang
    APPLIED SOFT COMPUTING, 2023, 143
  • [33] Fast taboo search algorithm for solving job shop scheduling problems
    Deng, Zelin
    Huang, Wenqi
    Zhou, Ligang
    2003, Huazhong University of Science and Technology (31):
  • [34] Solving Fuzzy Job-Shop Scheduling Problems with a Multiobjective Optimizer
    Thanh-Do Tran
    Varela, Ramiro
    Gonzalez-Rodriguez, Ines
    Talbi, El-Ghazali
    KNOWLEDGE AND SYSTEMS ENGINEERING (KSE 2013), VOL 2, 2014, 245 : 197 - 209
  • [35] Solving flexible job shop scheduling problems in manufacturing with Quantum Annealing
    Philipp Schworm
    Xiangqian Wu
    Moritz Glatt
    Jan C. Aurich
    Production Engineering, 2023, 17 : 105 - 115
  • [36] A heuristic combination method for solving job-shop scheduling problems
    Hart, E
    Ross, P
    PARALLEL PROBLEM SOLVING FROM NATURE - PPSN V, 1998, 1498 : 845 - 854
  • [37] Solving job-shop scheduling problems by means of genetic algorithms
    Varela, Ramiro
    Vela, Camino R.
    Puente, Jorge
    Gomez, Alberto
    Vidal, Ana M.
    The Practical Handbook of Genetic Algorithms: Applications, Second Edition, 2000, : 275 - 294
  • [38] Solving flexible job shop scheduling problems in manufacturing with Quantum Annealing
    Schworm, Philipp
    Wu, Xiangqian
    Glatt, Moritz
    Aurich, Jan C.
    PRODUCTION ENGINEERING-RESEARCH AND DEVELOPMENT, 2023, 17 (01): : 105 - 115
  • [39] Application of Grey Wolf Optimization for Solving Combinatorial Problems: Job Shop and Flexible Job Shop Scheduling Cases
    Jiang, Tianhua
    Zhang, Chao
    IEEE ACCESS, 2018, 6 : 26231 - 26240
  • [40] Applying a hybrid artificial immune systems to the job shop scheduling problem
    Weckman, Gary
    Bondal, Akshata A.
    Rinder, Magda M.
    Young, William A., II
    NEURAL COMPUTING & APPLICATIONS, 2012, 21 (07): : 1465 - 1475
12345