| 000 | 01806nam a2200253 a 4500 | ||
|---|---|---|---|
| 001 | vtls000067936 | ||
| 003 | KUKTEM | ||
| 005 | 20251117113228.0 | ||
| 008 | 121224t2012 my a f m 000 0 eng d | ||
| 020 | _aTHE0002363(Local) | ||
| 039 | 9 |
_a201905271201 _bshamsul _y201212241133 _zida |
|
| 040 | _aUMP | ||
| 090 | _aT57.84 .E45 2012 rs Bc. | ||
| 100 | 0 | _aEmilia Adzmi | |
| 245 | 1 | 0 |
_aLecture timetabling using heuristic technique / _cEmilia Adzmi |
| 260 |
_aKuantan, Pahang : _bUMP, _c2012 |
||
| 300 |
_axii, 57 p. : _bill. ; _c30 cm. + _e1 CD-ROM |
||
| 502 | _aProject paper (Bachelor of Computer Science (Software Engineering)) -- Universiti Malaysia Pahang - 2012 | ||
| 504 | _aBibliography : p. 55 | ||
| 520 | 3 | _aThe purpose of this paper is to try to develop a system about lecture timetabling problem. This project presents about Lecture Timetabling using Heuristic Method. Timetabling is a well known difficult combinatorial problem. In recent years, several techniques have been used to automatically generate university timetabling problems, including graph colouring heuristics and a lot more. Timetabling deals with the problem of placing certain resources into a limited number of time slots, subject to given constraints, in order to satisfy a set of stated objectives to the highest possible extent. In this paper, by using the proposed heuristic technique, a lecture timetable is produced considering some constraints that are able to be satisfied. Though it is impossible to consider all constraints in one timetable, the system proposed try to satisfied some of the constraints in order to generate the lecture timetable. | |
| 650 | 0 | _aHeuristic programming | |
| 650 | 0 | _aScheduling | |
| 999 |
_aVIRTUA40 _c5054 _d5060 |
||
| 999 | _aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5020*5040*5200*6500*6501*9992 | ||