Job Shop Scheduling using the Clonal Selection Principle

  • Carlos A. Coello Coello
  • Daniel Cortés Rivera
  • Nareli Cruz Cortés


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.


Genetic Algorithm Schedule Problem Mutation Operator Greedy Randomize Adaptive Search Procedure Artificial Immune System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    M. Pinedo. Scheduling—Theory, Algorithms, and Systems. Prentice Hall, Englewood Cliffs, 1995.MATHGoogle Scholar
  2. 2.
    Kenneth R. Baker. Introduction to Sequencing and Scheduling. John Wiley & Sons, New York, 1974.Google Scholar
  3. 3.
    Tapan P. Bagchi. Multiobjective Scheduling by Genetic Algorithms. Kluwer Academic Publishers, New York, September 1999.MATHCrossRefGoogle Scholar
  4. 4.
    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.CrossRefGoogle Scholar
  5. 5.
    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.CrossRefGoogle Scholar
  6. 6.
    J.W. Barnes and J.B. Chambers. Solving the Job Shop Scheduling Problem using Taboo Search. IIE Transactions, 27(2):257–263, 1995.CrossRefGoogle Scholar
  7. 7.
    Olivier Catoni. Solving Scheduling Problems by Simulated Annealing. SIAM Journal on Control and Optimization, 36(5):1539–1575, September 1998.MathSciNetMATHCrossRefGoogle Scholar
  8. 8.
    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.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    David S. Johnson Michael R. Garey. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979.Google Scholar
  12. 12.
    Albert Jones and Luis C. Rabelo. Survey of Job Shop Scheduling Techniques. National Institute of Standards and Technology, 1998.Google Scholar
  13. 13.
    J. Adams E. Balas and D. Zawack. The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3):391–401, 1988.MathSciNetMATHCrossRefGoogle Scholar
  14. 14.
    Thomas E. Morton and David W. Pentico. Heuristic Scheduling Systems: With Applications to Production Systems and Project Management. John Wiley & Sons, 1993.Google Scholar
  15. 15.
    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.CrossRefGoogle Scholar
  16. 16.
    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.Google Scholar
  17. 17.
    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.Google Scholar
  18. 18.
    J. E. Beasley. OR-Library: Distributing Test Problems by Electronic Mail. Journal of the Operations Research Society, 41(11):1069–1072, 1990.Google Scholar
  19. 19.
    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.Google Scholar
  20. 20.
    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.MathSciNetCrossRefGoogle Scholar
  21. 21.
    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).Google Scholar

Copyright information

© Springer-Verlag London 2004

Authors and Affiliations

  • Carlos A. Coello Coello
    • 1
  • Daniel Cortés Rivera
    • 1
  • Nareli Cruz Cortés
    • 1
  1. 1.CINVESTAV-IPN (Evolutionary Computation Group) Depto. de Ingeniería El7#x00E9;ctricaSección de Computación Av. IPN No. 2508, Col. San Pedro ZacatencoMéxico, D. F.MEXICO

Personalised recommendations