Solving Examination Timetabling Problem using Partial Exam Assignment with Hill Climbing Search
This paper describes a method that combines graph heuristics and hill climbing for addressing the examination timetable problem. In this approach, all exams are ordered with graph heuristic ordering approach and partial exams are considered for scheduling. These partial scheduled exams are then imp...
Main Authors: | , |
---|---|
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2015
|
Subjects: | |
Online Access: | http://umpir.ump.edu.my/id/eprint/5946/ http://umpir.ump.edu.my/id/eprint/5946/ http://umpir.ump.edu.my/id/eprint/5946/1/Solving%20Examination%20Timetabling%20Problem%20Using%20Partial%20Exam%20Assignment%20with%20Hill%20Climbing%20Search.pdf |