Abstract
In this chapter, we will create a genetic algorithm that schedules classes for a college timetable. We will examine a couple of different scenarios in which a class-scheduling algorithm may be used, and the constraints that are usually implemented when designing a timetable. Finally, we will build a simple class scheduler, which can be expanded to support more complex implementations.
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 subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 Lee Jacobson and Burak Kanber
About this chapter
Cite this chapter
Jacobson, L., Kanber, B. (2015). Class Scheduling. In: Genetic Algorithms in Java Basics. Apress, Berkeley, CA. https://doi.org/10.1007/978-1-4842-0328-6_5
Download citation
DOI: https://doi.org/10.1007/978-1-4842-0328-6_5
Publisher Name: Apress, Berkeley, CA
Print ISBN: 978-1-4842-0329-3
Online ISBN: 978-1-4842-0328-6
eBook Packages: Professional and Applied ComputingProfessional and Applied Computing (R0)Apress Access Books