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 条
  • [21] An Artificial Intelligence Software Application for Solving Job Shop Scheduling Problem
    Toader, Florentina Alina
    PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON VIRTUAL LEARNING, 2014, : 439 - 443
  • [22] Hybrid artificial bee colony algorithm with a rescheduling strategy for solving flexible job shop scheduling problems
    Li, Xixing
    Peng, Zhao
    Du, Baigang
    Guo, Jun
    Xu, Wenxiang
    Zhuang, Kejia
    COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 113 : 10 - 26
  • [23] An application of immune algorithms for job-shop scheduling problems
    Miyashita, T
    PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON ASSEMBLY AND TASK PLANNING (ISATP2003), 2003, : 146 - 150
  • [24] Adaptive immune algorithm for solving job-shop scheduling problem
    Xu, XL
    Wang, WL
    Guan, Q
    ADVANCES IN NATURAL COMPUTATION, PT 2, PROCEEDINGS, 2005, 3611 : 795 - 799
  • [25] Solving a job shop scheduling problem
    Kumar, K. R. Anil
    Dhas, J. Edwin Raja
    JOURNAL OF THE CHINESE INSTITUTE OF ENGINEERS, 2023, 46 (04) : 315 - 330
  • [26] APPLYING IMPROVED GENETIC ALGORITHM FOR SOLVING JOB SHOP SCHEDULING PROBLEMS
    Janes, Gordan
    Perinic, Mladen
    Jurkovic, Zoran
    TEHNICKI VJESNIK-TECHNICAL GAZETTE, 2017, 24 (04): : 1243 - 1247
  • [27] Solving Open Job-Shop Scheduling Problems by SAT Encoding
    Koshimura, Miyuki
    Nabeshima, Hidetomo
    Fujita, Hiroshi
    Hasegawa, Ryuzo
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (08) : 2316 - 2318
  • [28] GA with Priority Rules for Solving Job-Shop Scheduling Problems
    Hasan, S. M. Kamrul
    Sarker, Ruhul
    Cornforth, David
    2008 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-8, 2008, : 1913 - 1920
  • [29] A Genetics Algorithm for Solving Job-Shop Scheduling Problems in FMS
    Li, Shoutao
    Jiang, Wei
    Tian, Wei
    2015 27TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2015, : 1634 - 1639
  • [30] A Memetic Algorithm for Solving Flexible Job-shop Scheduling Problems
    Ma, Wenping
    Zuo, Yi
    Zeng, Jiulin
    Liang, Shuang
    Jiao, Licheng
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 66 - 73
12345