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 library of antibodies to construct solutions. It also uses a local selection mechanism that tries to eliminate gaps between jobs in order to improve solutions produced by the search mechanism of the algorithm. The proposed approach is compared with respect to GRASP (an enumerative approach) in several test problems taken from the specialized literature. Our results indicate that the proposed algorithm is highly competitive, being able to produce better solutions than GRASP in several cases, at a fraction of its computational cost.
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.
Similar content being viewed by others
References
Bagchi, T.P.: MultiObjective Scheduling by Genetic Algorithms. Kluwer Academic Publishers, NewYork (September 1999) ISBN 0-7923-8561-6.
Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Sons, New York (1974)
Adams, J., Balas, E., Zawack, D.: The shifting bottleneck procedure for job shop scheduling. Management science 34(3), 391–401 (1988)
Barnes, J.W., Chambers, J.B.: Solving the Job Shop Scheduling Problem using Tabu Search. IIE Transactions 27(2), 257–263 (1995)
Beasley, J.E.: OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operations Research Society 41(11), 1069–1072 (1990)
Binato, S., Hery, W.J., Loewenstern, D.M., Resende, M.G.C.: A GRASP for Job Shop Scheduling. In: Celso, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 59–80. Kluwer Academic Publishers, Boston (2001)
Catoni, O.: Solving Scheduling Problems by Simulated Annealing. SIAM Journal on Control and Optimization 36(5), 1539–1575 (1998)
Cheng, R., Gen, M., Tsujimura, Y.: A tutorial survey of job-shop scheduling problems using genetic algorithms: I. Representation. Computers and Industrial Engineering 30, 983–997 (1996)
Cheng, R., Gen, M., Tsujimura, Y.: 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)
Cui, X., Li, M., Fang, T.: Study of Population Diversity of Multiobjective Evolutionary Algorithm Based on Immune and Entropy Principles. In: Proceedings of the Congress on Evolutionary Computation 2001 (CEC 2001), Piscataway, New Jersey, May 2001, vol. 2, pp. 1316–1321 (2001) ; IEEE Service Center
de Castro, L.N., Timmis, J. (eds.): An Introduction to Artificial Immune Systems: A New Computational Intelligence Paradigm. Springer, Heidelberg (2002)
Dorndorf, U., Pesch, E.: Evolution based learning in a job shop scheduling environment. Computers & Operations Research 22, 25–40 (1995)
Feo, T.A., Resende, M.G.C.: Greedy Randomized Adaptive Search Procedures. Journal of Global Optimization 6, 109–133 (1995)
Hart, E., Ross, P.: The Evolution and Analysis of a Potential Antibody Library for Use in Job-Shop Scheduling. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 185–202. McGraw-Hill, London (1999)
Hart, E., Ross, P., Nelson, J.: Producing robust schedules via an artificial immune system. In: Proceedings of the 1998 IEEE International Conference on Evolutionary Computation (ICEC 1998), Anchorage, Alaska, pp. 464–469. IEEE Press, Los Alamitos (1998)
Hightower, R., Forrest, S., Perelson, A.S.: The evolution of emergent organization in immune system gene libraries. In: Eshelman, L.J. (ed.) Proceedings of the 6th. International Conference on Genetic Algorithms, pp. 344–350. Morgan Kaufmann, San Francisco (1995)
Jones, A., Rabelo, L.C.: Survey of Job Shop Scheduling Techniques. NISTIR, National Institute of Standards and Technology (1998)
Coffman Jr., E.G.: Computer and Job Shop Scheduling Theory. John Wiley and Sons, Chichester (1976)
Johnson, D.S., Garey, M.R.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W H Freeman & Co., New York (June 1979) ISBN 0-7167-1045-5
Morton, T.E., Pentico, D.W.: Heuristic Scheduling Systems: With Applications to Production Systems and Project Management. Wiley Series in Engineering & Technology Management. John Wiley & Sons, Chichester (1993)
Muth, J.F., Thompson, G.L. (eds.): Industrial Scheduling. Prentice Hall, Englewood Cliffs (1963)
de Castro, L.N., Timmis, J.: Artificial Immnue System: A New Computational Intelligence Approach, Great Britain. Springer, Heidelberg (2002) ISBN 1-8523-594-7
de Castro, L.N., Von Zuben, F.J.: Learning and Optimization Using the Clonal Selection Principle. IEEE Transactions on Evolutionary Computation 6(3), 239–251 (2002)
Oprea, M.: Antibody Repertories and Pathogen Recognition:The Role of Germline Diversity and Somatic Hypermutation. PhD thesis, University of New Mexico, Albuquerque, NM (1999)
Perelson, A., Hightower, R., Forrest, S.: Evolution and Somatic Learning in V-Region Genes. Research in Immunology 147, 202–208 (1996)
Pinedo, M.: Scheduling—Theory, Algorithms, and Systems. Prentice Hall, Englewood Cliffs (1995)
Yamada, T., Nakano, R.: Job-shop scheduling. In: Zalzala, A.M.S., Fleming, P.J. (eds.) Genetic Algorithms in Engineering Systems. IEE control engineering series, ch. 7, pp. 134–160. The Institution of Electrical Engineers (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coello, C.A.C., Rivera, D.C., Cortés, N.C. (2003). Use of an Artificial Immune System for Job Shop Scheduling. In: Timmis, J., Bentley, P.J., Hart, E. (eds) Artificial Immune Systems. ICARIS 2003. Lecture Notes in Computer Science, vol 2787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45192-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-45192-1_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40766-9
Online ISBN: 978-3-540-45192-1
eBook Packages: Springer Book Archive