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 Curr...

Full description

Bibliographic Details
Main Authors: Keat, Teoh Chong, Haron, Habibollah, Wibowo, Antoni, Ngadiman, Mohd Salihin
Format: Article
Language:English
Published: Maxwell Science Publications 2015
Subjects:
QA75 Electronic computers. Computer science
Online Access:http://eprints.utm.my/55467/1/HabibollahHaron2015_AHeuristicRoomMatchingAlgorithm.pdf

Similar Items

Similar Items