Automating the UMP open registration (or) system for course timetabling problem / Kangeswary Kuppusamy
Material type:
TextPublication details: Kuantan, Pahang : UMP, 2013Description: xi, 48 p. : ill. (some col.) ; 30 cm. + 1 CD-ROMISBN: - THE0001831(Local)
| Item type | Current library | Call number | Copy number | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
Final Year Report
|
UMPLIB GAMBANG | CD 8301 | QA76.76.D47 K364 2013 r Bc. (Browse shelf(Opens below)) | 1 | Not for loan | 0000087032 | ||
Final Year Report
|
UMPLIB PEKAN | QA76.76.D47 K364 2013 r Bc. (Browse shelf(Opens below)) | 1 | Not for loan | 0000087031 |
Project paper (Bachelor of Computer Science (Computer Systems and Networking)) -- Universiti Malaysia Pahang – 2013
Bibliography : p. 41-43
The open registration (OR) system is different from the “Program-based Registration System” which allows student to register their academic subject based on their own study plan. UMP’s students are required to make the combination of the study plan to make sure their timetable is suitable with their favorite time. There are some methods on solving the timetabling such as Tabu Search (Qu et al.., 2009), Hill Climbing (Appleby et al 2011), Simulated Annealing (Kirkpatrick and Vecci, 1983) and Great Deluge Algorithm (Dueck,1993) which had been used to solve the college or University timetabling problems. These searching methods fulfilled the automated timetabling system and applied on many systems. These researches will benefit the UMP’s student to view the course information with more specific details and convenience the process course registration online.