Scheduling with Memetic Algorithms over the Spaces of Semi-active and Active Schedules

  • Miguel A. González
  • Camino R. Vela
  • Ramiro Varela
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4029)


The Job Shop Scheduling Problem is a paradigm of Constraint Satisfaction Problems that has interested to researchers over the last decades. In this paper we confront this problem by means of a Genetic Algorithm that is hybridized with a local search method. The Genetic Algorithm searches over the space of active schedules, whereas the local search does it over the space of semi-active ones. We report results from an experimental study over a set of selected problem instances showing that this combination of search spaces is better than restricting both algorithms to search over the same space. Furthermore we compare with the well-known Genetic Algorithms proposed by D. Mattfeld and the Branch and Bound procedure proposed by P. Brucker and obtain competitive results.


Genetic Algorithm Local Search Critical Path Constraint Satisfaction Problem Memetic Algorithm 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bierwirth, C.: A Generalized Permutation Approach to Jobshop Scheduling with Genetic Algorithms. OR Spectrum 17, 87–92 (1995)MATHGoogle Scholar
  2. 2.
    Bierwirth, C., Mattfeld, D.C.: Production scheduling and rescheduling with genetic algoritms. Evolutionary Computation 7, 1–17 (1999)CrossRefGoogle Scholar
  3. 3.
    Brucker, P., Jurisch, B., Sievers, B.: A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics 49, 107–127 (1994)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Heidelberg (2004)MATHGoogle Scholar
  5. 5.
    Dell’ Amico, M., Trubian, M.: Applying Tabu Search to the Job-shop Scheduling Problem. Annals of Operational Research 41, 231–252 (1993)MATHCrossRefGoogle Scholar
  6. 6.
    Giffler, B., Thomson, G.L.: Algorithms for solving production scheduling problems. Operations Research 8, 487–503 (1960)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. uropean Journal of Operational Research 113, 390–434 (1999)MATHCrossRefGoogle Scholar
  8. 8.
    Mattfeld, D.C.: Evolutionary Search and the Job Shop. In: Investigations on Genetic Algorithms for Production Scheduling, Springer, Heidelberg (1995)Google Scholar
  9. 9.
    Nowicki, E., Smutnicki, C.: A Fast Taboo Search Algorithm for the Job Shop Scheduling Problem. Management Science 42(6), 797–813 (1996)MATHCrossRefGoogle Scholar
  10. 10.
    Taillard, E.D.: Parallel Taboo Search Techniques for the Job Shop Scheduling Problem. ORSA Jorunal on Computing 6, 108–117 (1993)Google Scholar
  11. 11.
    Vaessens, R.J.M., Aarts, E.H.L., Lenstra, J.K.: A Local Search Template. In: Mnner and Manderick, pp. 65–74 (1992)Google Scholar
  12. 12.
    Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Job Shop Scheduling by Simulated Annealing. ORSA Journal on Computing 40, 113–125 (1992)MATHGoogle Scholar
  13. 13.
    Varela, R., Vela, C.R., Puente, J., Gómez, A.: A knowledge-based evolutionary strategy for scheduling problems with bottlenecks. European Journal of Operational Research 145, 57–71 (2003)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Varela, R., Serrano, D., Sierra, M.: New Codification Schemas for Scheduling with Genetic Algorithms. LNCS 3562, Springer-Verlag 145, 11–20 (2003)Google Scholar
  15. 15.
    Yamada, T., Nakano, R.: Scheduling by Genetic Local Search with multi-step crossover. In: Fourth Int. Conf. On Parallel Problem Solving from Nature (PPSN IV), Berlin, Germany, pp. 960–969 (1996)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Miguel A. González
    • 1
  • Camino R. Vela
    • 1
  • Ramiro Varela
    • 1
  1. 1.Artificial Intelligence CenterUniversity of OviedoSpain

Personalised recommendations