Solving the university course scheduling problem using recursive largest first algorithm and simulated annealing
Abstract: This study is about solving the course scheduling problem using a hybrid approach of graph coloring and Simulated Annealing. The course scheduling problem is a timetabling problem wherein resources such as courses, teachers and students were allocated to an appropriate schedule without con...
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit |
| Sprache: | English |
| Veröffentlicht: |
2013
|