Work

Faculty scheduling using genetic algorithms

Year: 2006
Type: dissertation
Abstract: The problem of developing a class schedule for a faculty has been proven to be NP-complete. Therefore when the schedule is large enough, finding just one feasible solution can be impossible for any direct search algorithm within a reasonable time. This project is geared toward investigating the possibility of using genetic-based algorithms to solve faculty scheduling problems of 100 courses or larger quickly. Multiple versions of genetic algorithms and heuristics are tested. Many parameter levels for these algorithms are optimized for fastest convergence.
Author: Kevin Soule
Language: English
Open Access status: green
OpenAlex ID: W815862420
Cites: 4
Cited by: 2
Related to: 10