000 02315nam a2200289 a 4500
001 vtls000077107
003 KUKTEM
005 20251114204602.0
008 140327t2013 my a f m 000 0 eng d
020 _aTHE0001983(Local)
039 9 _a201905131553
_byusri
_y201403271223
_zFida
040 _aUMP
090 _aQA76.9.S88 L56 2013 rs Bc.
100 1 _aLim, Ruey Long
245 1 0 _aSolving toronto examination timetabling using heuristic method /
_cLim Ruey Long
260 _aKuantan, Pahang :
_bUMP,
_c2013
300 _axii, 67 p. :
_bill. ;
_c30 cm. +
_e1 CD-ROM
502 _aProject paper (Bachelor of Computer Science (Software Engineering) -- Universiti Malaysia Pahang - 2012
504 _aBibliography : p.55-57
520 3 _aThe examination timetabling problem has attracted the interested of many researchers over the years. However, this problem is difficult to solve due to the lack of benchmark dataset and many constraints that need to be satisfied in examination timetabling problem. Toronto benchmark data contains 13 real-world examination timetabling problem which have different conflict density for every dataset. Many researchers solved Toronto benchmark data using different method in order to produce a timetable which is feasible and solve all the constraints. To produce a feasible examination timetable, all the exams need to be scheduled into timeslot while satisfying the hard constraint and soft constraint. The timetable result should have the minimum penalty value in term of spread exams. Therefore, the technique partial graph heuristic with hill climbing method should be implemented to solve Toronto examination timetabling problem. The graph heuristic method will partially schedule the exam and then improved by hill climbing method. This process will be repeated until all the exams are scheduled. By using this technique, the solution of timetable result can comply all of the constraints and has a competitive result compared to other researchers' result.
650 0 _aSystem design
650 0 _aManagement information systems
650 0 _aOnline data processing
650 0 _aHeuristic programming
650 0 _aExaminations
_xTimetables
999 _aVIRTUA40
_c4579
_d4585
999 _aVTLSSORT0080*0200*0400*0900*1000*2450*2600*3000*5020*5040*5200*6500*6501*6502*6503*6504*9992