Summary
In this chapter we confront the Job Shop Scheduling problem by means of Genetic Algorithms. Our aim is twofold: first to envisage a codification schema that makes it clear what we consider the basic building blocks of a chromosome, that is the partial schedules of the set of tasks requiring the same resource; and then to design a scheduling policy that maintains as long as possible these partial schedules. The expected utility of this new codification is that it allows us to design knowledge-based operators and initialization strategies. We report results from an experimental study on a small set of selected problems showing that our proposed codification and scheduling algorithm layouts produce similar results to other conventional schemas. And at the same time this codification facilitates the design of genetic operators focused to produce promising building blocks.
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... (1995) A generalized perutation approach to job shop scheduling with genetic algorithms. OR Spektrum, 17:87–92.
Bierwirth, C., D. C. Mattfeld (1999) Production scheduling and rescheduling with Genetic algoritms, Evolutionary Computation, 7(1):1–17.
Dorndorf, U., E. Pesch, (1995) Evolution based learning in a job shop scheduling environment, Computers & Operations Research, 22:25–40.
Fang, H.L., P. Ross, D. Corne, (1993) A promising genetic algorithm approach to jobshop scheduling, rescheduling, and open-shop scheduling problems, Proc. Fifth Intel. Conf. Genetic Algorithms, 375–382.
Giffler, B., G.L Thomson,. (1960) Algorithms for solving production scheduling problems, Operations Reseach, 8:487–503.
Goldberg, D. (1985) Genetic Algorithms in Search, Optimization & Machine Learning, Addison-Wesley, Reading, MA.
Grefenstette, J.J. (1987) Incorporating problem specific knowledge in genetic algorithms, in: Genetic Algorithms and Simulated Annealing, Morgan Kaufmann, pp. 42–60.
Matfeld, D.C. (1995) Evolutionary search and the job shop. Investigations on Genetic Algorithms for Production Scheduling. Springer-Verlag.
Michalewicz, Z. (1994) Genetic Algorithms + Data Structures = Evolution Program. Second, Extended Edition, Springer-Verlag.
Sadeh, N., M.S. Fox, (1996) Variable and value ordering heuristics for the Job Shop Scheduling Constraint Satisfaction Problem, Artificial Intelligence, 86:1–41.
Syswerda, G. (1991) Schedule Optimization Using Genetic Algorithms, in Handbook of Genetic Algorithms, (ed.) L. Davis, Van Nostrand Reinhold, New York, pp. 1332–13490.
Varela, R., C.R. Vela, J. Puente, A. Gómez (2003) A Knowledge-Based Evolutionary Strategy for Scheduling Problems with Bottlenecks. European Journal of Operational Research. 145(1): 57–71.
Yamada, T. and Nakano, R. (1996) Scheduling by Genetic Local Search with multistep crossover. In: Fourth Int. Conf. On Parallel Problem Solving from Nature (PPSN IV), Berlin, Germany, pp. 960–969.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag London Limited
About this chapter
Cite this chapter
Varela, R., Vela, C.R., Puente, J., Serrano, D., Suárez, A. (2005). A New Chromosome Codification for Scheduling Problems. In: Wu, X., Jain, L., Graña, M., Duro, R.J., d’Anjou, A., Wang, P.P. (eds) Information Processing with Evolutionary Algorithms. Advanced Information and Knowledge Processing. Springer, London. https://doi.org/10.1007/1-84628-117-2_6
Download citation
DOI: https://doi.org/10.1007/1-84628-117-2_6
Publisher Name: Springer, London
Print ISBN: 978-1-85233-866-4
Online ISBN: 978-1-84628-117-4
eBook Packages: Computer ScienceComputer Science (R0)