An effective hybrid local search approach for the post enrolment course timetabling problem
We address the post enrolment course timetabling (PE-CTT) problem in this paper. PE-CTT is known as an NP-hard problem that focuses on finding an efficient allocation of courses onto a finite number of time slots and rooms. It is one of the most challenging resources allocation problems faced by uni...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.ums.edu.my/id/eprint/25976/1/An%20effective%20hybrid%20local%20search%20approach%20for%20the%20post%20enrolment%20course%20timetabling%20problem.pdf https://eprints.ums.edu.my/id/eprint/25976/2/An%20effective%20hybrid%20local%20search%20approach%20for%20the%20post%20enrolment%20course%20timetabling%20problem1.pdf |
Internet
https://eprints.ums.edu.my/id/eprint/25976/1/An%20effective%20hybrid%20local%20search%20approach%20for%20the%20post%20enrolment%20course%20timetabling%20problem.pdfhttps://eprints.ums.edu.my/id/eprint/25976/2/An%20effective%20hybrid%20local%20search%20approach%20for%20the%20post%20enrolment%20course%20timetabling%20problem1.pdf