MARC details
| 000 -LEADER |
|---|
| fixed length control field |
02315nam a2200289 a 4500 |
| 001 - CONTROL NUMBER |
|---|
| control field |
vtls000077107 |
| 003 - CONTROL NUMBER IDENTIFIER |
|---|
| control field |
KUKTEM |
| 005 - DATE AND TIME OF LATEST TRANSACTION |
|---|
| control field |
20251114204602.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
140327t2013 my a f m 000 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
THE0001983(Local) |
| 039 #9 - LEVEL OF BIBLIOGRAPHIC CONTROL AND CODING DETAIL [OBSOLETE] |
|---|
| Level of rules in bibliographic description |
201905131553 |
| Level of effort used to assign nonsubject heading access points |
yusri |
| -- |
201403271223 |
| -- |
Fida |
| 040 ## - CATALOGING SOURCE |
|---|
| Original cataloging agency |
UMP |
| 090 ## - LOCALLY ASSIGNED LC-TYPE CALL NUMBER (OCLC); LOCAL CALL NUMBER (RLIN) |
|---|
| Classification number (OCLC) (R) ; Classification number, CALL (RLIN) (NR) |
QA76.9.S88 L56 2013 rs Bc. |
| 100 1# - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Lim, Ruey Long |
| 245 10 - TITLE STATEMENT |
|---|
| Title |
Solving toronto examination timetabling using heuristic method / |
| Statement of responsibility, etc. |
Lim Ruey Long |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. |
|---|
| Place of publication, distribution, etc. |
Kuantan, Pahang : |
| Name of publisher, distributor, etc. |
UMP, |
| Date of publication, distribution, etc. |
2013 |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xii, 67 p. : |
| Other physical details |
ill. ; |
| Dimensions |
30 cm. + |
| Accompanying material |
1 CD-ROM |
| 502 ## - DISSERTATION NOTE |
|---|
| Dissertation note |
Project paper (Bachelor of Computer Science (Software Engineering) -- Universiti Malaysia Pahang - 2012 |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc. note |
Bibliography : p.55-57 |
| 520 3# - SUMMARY, ETC. |
|---|
| Summary, etc. |
The 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 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
System design |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Management information systems |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Online data processing |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Heuristic programming |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name entry element |
Examinations |
| General subdivision |
Timetables |