A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem

A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem

Show other versions (1)

The University Course Timetabling Problem (UCTP) such as the curriculum-based course timetabling problem is both an NP-hard and NP-complete scheduling problem.The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institution.The Curric...

Full description

Bibliographic Details
Main Authors: Teoh, Chong Keat, Haron, Habibollah, Wibowo, Antoni, Ngadiman, Mohd Salihin
Format: Article
Language:English
Published: MAXWELL Science Publication 2015
Subjects:
QA Mathematics
Online Access:https://repo.uum.edu.my/id/eprint/18608/1/RJASET%2010%208%202015%20882-889.pdf

Internet

https://repo.uum.edu.my/id/eprint/18608/1/RJASET%2010%208%202015%20882-889.pdf

Similar Items