Irene, Ho Sheau Fen and Deris, Safaai and Mohd Hashim, Siti Zaiton (2008) Investigating constraint-based reasoning for university timetabling problem. In: Imecs 2009: International Multi-Conference Of Engineers And Computer Scientists, Vols I and II. Lecture Notes in Engineering and Computer Science . Int Assoc Engineers-Iaeng, China, pp. 139-143. ISBN 978-988-17012-2-0
Full text not available from this repository.
University Course Timetabling Problems (UCTP) are a NP-complete, real-world problems, with many soft and hard constraints involved. The difficulties in generating a good timetable solution are different in almost every institution. This paper investigates the constraint-based reasoning algorithm to solve this complex UCTP. The approach used constraints-based reasoning to search for the best preference value base on the student capacity for each lecture. The proposed algorithm has been tested using a real world data from Faculty of Computer Science and Information System, University of Technology Malaysia and Faculty of Science at Ibb University - Yemen.
|Item Type:||Book Section|
|Additional Information:||ISBN: 978-988-17012-2-0; International Multi-Conference of Engineers and Computer Scientists, Kowloon, Peoples R China, Mar 18-20, 2009|
|Uncontrolled Keywords:||university course timetabling problem, constraint-based reasoning|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Computer Science and Information System|
|Deposited By:||Liza Porijo|
|Deposited On:||06 Jul 2011 01:06|
|Last Modified:||06 Jul 2011 01:06|
Repository Staff Only: item control page