| 000 | 01905nam a2200277 a 4500 | ||
|---|---|---|---|
| 001 | vtls000068051 | ||
| 003 | KUKTEM | ||
| 005 | 20251114204534.0 | ||
| 008 | 130108t2012 my a f m 000 0 eng d | ||
| 020 | _aTHE0001990(Local) | ||
| 039 | 9 |
_a201905131556 _byusri _y201301081633 _zFida |
|
| 040 | _aUMP | ||
| 090 | _aQA76.9.S88 W66 2012 rs Bc. | ||
| 100 | 1 | _aWong, Wei Leong | |
| 245 | 1 | 0 |
_aImplementation of ump course registration system using heuristic method / _cWong Wei Leong |
| 260 |
_aKuantan, Pahang : _bUMP, _c2012 |
||
| 300 |
_axv, 59 p. : _bill. ; _c30 cm. + _e1 CD-ROM |
||
| 502 | _aProject paper (Bachelor of Computer Science (Computer System and Networking) -- Universiti Malaysia Pahang - 2012 | ||
| 504 | _aBibliography : p.49-53 | ||
| 520 | 3 | _aThe Open Registration (OR) system is different from the “Program-based Registration System” which allows students 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. | |
| 650 | 0 | _aSystem design | |
| 650 | 0 | _aManagement information systems | |
| 650 | 0 | _aOnline data processing | |
| 650 | 0 | _aHeuristic programming | |
| 999 |
_aVIRTUA40 _c3767 _d3773 |
||
| 999 | _aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5020*5040*5200*6500*6501*6502*6503*9992 | ||