Using new metrics to find a good examination schedule. (English) Zbl 07866758
Summary: The problem of finding an optimal examination schedule is known to be an NP-complete problem. Researchers often employ heuristics such as simulated annealing and genetic algorithms to find good examination schedules. In this paper, we compare the three heuristic approaches from the perspective of students.
MSC:
| 90Bxx | Operations research and management science |
| 68W50 | Evolutionary algorithms, genetic algorithms (computational aspects) |
| 68Q17 | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) |
