New Codification Schemas for Scheduling with Genetic Algorithms

  • Ramiro Varela
  • David Serrano
  • María Sierra
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3562)

Abstract

Codification is a very important issue when a Genetic Algorithm is designed to dealing with a combinatorial problem. In this paper we introduce new codification schemas for the Job Shop Scheduling problem which are extensions of two schemas of common use, and are worked out from the concept of underlying probabilistic model. Someway the underlying probabilistic model of a codification schema accounts for a tendency of the schema to represent solutions in some region of the search space. We report results from an experimental study showing that in many cases any of the new schemas results to be much more efficient than conventional ones due to the new schema tends to represent more promising solutions than the others. Unfortunately the selection in advance of the best schema for a given problem instance is not an easy problem and remains still open.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.: Production Scheduling and Rescheduling with Genetic Algorithms. Evolutionary Computation 7(1), 1–17 (1999)CrossRefGoogle Scholar
  3. 3.
    Giffler, B., Thomson, G.L.: Algorithms for Solving Production Scheduling Problems. Operations Reseach 8, 487–503 (1960)MATHCrossRefGoogle Scholar
  4. 4.
    Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research 113, 390–434 (1999)MATHCrossRefGoogle Scholar
  5. 5.
    Mattfeld, D.C.: Evolutionary Search and the Job Shop, November 1995. Investigations on Genetic Algorithms for Production Scheduling. Springer, Heidelberg (1995)Google Scholar
  6. 6.
    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
  7. 7.
    Varela, R., Puente, J., Vela, C.R.: Some Issues in Chromosome Codification for Scheduling Problems with Genetic Algorithms. In: ECAI 2004, Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, pp. 7–16 (2004)Google Scholar
  8. 8.
    Yamada, T., Nakano, R.: Scheduling by Genetic Local Search with multi-step crossover. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 960–969. Springer, Heidelberg (1996)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Ramiro Varela
    • 1
  • David Serrano
    • 1
  • María Sierra
    • 1
  1. 1.Dep. of Computer ScienceUniversity of Oviedo, Artificial Intelligence CenterGijónSpain

Personalised recommendations