Solving job shop scheduling problems using artificial immune system

The n-job, m-machine job shop scheduling (JSS) 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.

[1]  Shengxiang Yang,et al.  A new adaptive neural network and heuristics hybrid approach for job-shop scheduling , 2001, Comput. Oper. Res..

[2]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[3]  Krzysztof Trojanowski,et al.  Searching for Memory in Artificial Immune System , 2002, Intelligent Information Systems.

[4]  Saeid Nahavandi,et al.  Learning to detect texture objects by artificial immune approaches , 2004, Future Gener. Comput. Syst..

[5]  Egon Balas,et al.  Guided Local Search with Shifting Bottleneck for Job Shop Scheduling , 1998 .

[6]  João Marcos Travassos Romano,et al.  A paradigm for blind IIR equalization using the constant modulus criterion and an artificial immune network , 2003, 2003 IEEE XIII Workshop on Neural Networks for Signal Processing (IEEE Cat. No.03TH8718).

[7]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[8]  Leandro Nunes de Castro,et al.  The Clonal Selection Algorithm with Engineering Applications 1 , 2000 .

[9]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[10]  Keith Mander,et al.  Mutation Testing: An Artificial Immune System Approach , 2003 .

[11]  J. Erschler,et al.  Technical Note - Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem , 1976, Oper. Res..

[12]  Alan S. Perelson,et al.  Self-nonself discrimination in a computer , 1994, Proceedings of 1994 IEEE Computer Society Symposium on Research in Security and Privacy.

[13]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[14]  Emanuela Merelli,et al.  A tabu search method guided by shifting bottleneck for the job shop scheduling problem , 2000, Eur. J. Oper. Res..

[15]  Alper Döyen,et al.  A new approach to solve hybrid flow shop scheduling problems by artificial immune system , 2004, Future Gener. Comput. Syst..

[16]  F.J. Von Zuben,et al.  Makespan minimization on parallel processors: an immune-based approach , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[17]  Jonathan Timmis,et al.  A resource limited artificial immune system for data analysis , 2001, Knowl. Based Syst..

[18]  Dipankar Dasgupta,et al.  Artificial immune systems in industrial applications , 1999, Proceedings of the Second International Conference on Intelligent Processing and Manufacturing of Materials. IPMM'99 (Cat. No.99EX296).

[19]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[20]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[21]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[22]  Stephanie Forrest,et al.  Engineering an Immune System 1 , 2001 .

[23]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[24]  Shyh-Jier Huang.  Enhancement of thermal unit commitment using immune algorithms based optimization approaches , 1999 .