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.
This work has been supported by project FEDER-MCYT TIC2003-04153 and by FICYT under grant BP04-021.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bierwirth, C.: A Generalized Permutation Approach to Jobshop Scheduling with Genetic Algorithms. OR Spectrum 17, 87–92 (1995)
Bierwirth, C., Mattfeld, D.: Production Scheduling and Rescheduling with Genetic Algorithms. Evolutionary Computation 7(1), 1–17 (1999)
Giffler, B., Thomson, G.L.: Algorithms for Solving Production Scheduling Problems. Operations Reseach 8, 487–503 (1960)
Jain, A.S., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research 113, 390–434 (1999)
Mattfeld, D.C.: Evolutionary Search and the Job Shop, November 1995. Investigations on Genetic Algorithms for Production Scheduling. Springer, Heidelberg (1995)
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Varela, R., Serrano, D., Sierra, M. (2005). New Codification Schemas for Scheduling with Genetic Algorithms. In: Mira, J., Álvarez, J.R. (eds) Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. IWINAC 2005. Lecture Notes in Computer Science, vol 3562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499305_2
Download citation
DOI: https://doi.org/10.1007/11499305_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26319-7
Online ISBN: 978-3-540-31673-2
eBook Packages: Computer ScienceComputer Science (R0)