Abstract
In this paper, we propose an algorithm based on an artificial immune system to solve job shop scheduling problems. The approach uses clonal selection, hypermutations and a mechanism that explores the vicinity of a reference solution. It also uses a decoding strategy based on a search that tries to eliminate gaps in a schedule as to improve the solutions found so far. The proposed approach is compared with respect to three other heuristics using a standard benchmark available in the specialized literature. The results indicate that the proposed approach is very competitive with respect to the others against which it was compared. Our approach not only improves the overall results obtained by the other heuristics, but it also significantly reduces the CPU time required by at least one of them.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Pinedo. Scheduling—Theory, Algorithms, and Systems. Prentice Hall, Englewood Cliffs, 1995.
Kenneth R. Baker. Introduction to Sequencing and Scheduling. John Wiley & Sons, New York, 1974.
Tapan P. Bagchi. Multiobjective Scheduling by Genetic Algorithms. Kluwer Academic Publishers, New York, September 1999.
R. Cheng, M. Gen, and Y. Tsujimura. A tutorial survey of job-shop scheduling problems using genetic algorithms: I. Representation. Computers and Industrial Engineering, 30:983–997, 1996.
R. Cheng, M. Gen, and Y. Tsujimura. A tutorial survey of job-shop scheduling problems using genetic algorithms: II. Hybrid genetic search strategies. Computers and Industrial Engineering, 36(2):343–364, 1999.
J.W. Barnes and J.B. Chambers. Solving the Job Shop Scheduling Problem using Taboo Search. IIE Transactions, 27(2):257–263, 1995.
Olivier Catoni. Solving Scheduling Problems by Simulated Annealing. SIAM Journal on Control and Optimization, 36(5):1539–1575, September 1998.
Emma Hart, Peter Ross, and J. Nelson. Producing robust schedules via an artificial immune system. In Proceedings of ICEC’98, pp. 464–469, Anchorage, Alaska, 1998. IEEE Press.
Emma Hart and Peter Ross. The Evolution and Analysis of a Potential Antibody Library for Use in Job-Shop Scheduling. In David Corne et al., eds, New Ideas in Optimization, pp. 185–202, McGraw-Hill, 1999.
Carlos A. Coello Coello, Daniel Cortés Rivera, and Nareli Cruz Cortés. Use of an Artificial Immune System for Job Shop Scheduling. In Jon Timmis et al., eds, Proceedings of ICARIS’2003, pp. 1–10, September 2003. Springer-Verlag. Lecture Notes in Computer Science Vol. 2787.
David S. Johnson Michael R. Garey. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979.
Albert Jones and Luis C. Rabelo. Survey of Job Shop Scheduling Techniques. National Institute of Standards and Technology, 1998.
J. Adams E. Balas and D. Zawack. The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3):391–401, 1988.
Thomas E. Morton and David W. Pentico. Heuristic Scheduling Systems: With Applications to Production Systems and Project Management. John Wiley & Sons, 1993.
Leandro Nunes de Castro and Fernando José Von Zuben. Learning and Optimization Using the Clonal Selection Principle. IEEE Transactions on Evolutionary Computation, 6(3):239–251, 2002.
Takeshi Yamada and Ryohei Nakano. Job-shop scheduling. In A.M.S. Zalzala and P.J. Fleming, editors, Genetic Algorithms in Engineering Systems, pp. 134–160. The Institution of Electrical Engineers, 1997.
Leandro Nunes de Castro and Jonathan Timmis. Artificial Immune System: A New Computational Intelligence Approach. Springer Verlag, Great Britain, September 2002. ISBN 1-8523-594-7.
J. E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operations Research Society, 41(11):1069–1072, 1990.
José Fernando Goncalves, Jorge José Mendes, and Mauricio G.C. Resende. A Hybrid Genetic Algorithm for the Job Shop Scheduling Problem. Technical Report TD-5EAL6J, AT&T Labs Research, 180 Park Avenue, Florham Park, NJ 07932 USA, September 2002.
Renata M. Aiex, S. Binato, and Mauricio G.C. Resende. Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, 29(4):393–430, 2003.
José Fernando Goncalves and N.C. Beirao. Um algoritmo genético baseado em chaves aleatórias para sequenciamiento de operacoes. Revista Associacão Portuguesa de Desenvolvimento e Investigacão Operacional, 19:123–137, 1999. (in Portuguese).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag London
About this paper
Cite this paper
Coello Coello, C.A., Rivera, D.C., Cortés, N.C. (2004). Job Shop Scheduling using the Clonal Selection Principle. In: Parmee, I.C. (eds) Adaptive Computing in Design and Manufacture VI. Springer, London. https://doi.org/10.1007/978-0-85729-338-1_10
Download citation
DOI: https://doi.org/10.1007/978-0-85729-338-1_10
Publisher Name: Springer, London
Print ISBN: 978-1-85233-829-9
Online ISBN: 978-0-85729-338-1
eBook Packages: Springer Book Archive