UUM ETD | Universiti Utara Malaysian Electronic Theses and Dissertation
FAQs | Feedback | Search Tips | Sitemap

Examination Timetable Scheduling Using Tabu Search

Almabrok, Mohammed Saad (2008) Examination Timetable Scheduling Using Tabu Search. Masters thesis, Universiti Utara Malaysia.

[img] PDF
Mohammed_Saad_Almabrok.pdf
Restricted to Registered users only

Download (5MB)
[img]
Preview
PDF
Mohammed_Saad_Almabrok.pdf

Download (954kB) | Preview

Abstract

Examination Timetables are utilized to schedule exam-timeslots in field of Applied Science .It involved assigning times and places to suitable events by creating use of available resource. Badly designed examination timetables are not just inconvenient but proved high-priced in terms of wasting time and money. Hence, the major aim of this research is to investigate the internal method of Tabu Search in solving and improving exam-timetable problem. The research have targeted on class examination timetabling problem. Hence, Tabu search is an iterative search method. It uses a local search algorithm at every iteration to search for the finest solution in some subset of the neighborhood, which came from the finest solution obtained at the last iteration. This paper reports the powerful techniques using Tabu Search in scheduling. Examination Timetabling problem is one of the applications in scheduling. In one aspect, it deals with courses such that it executes the process time slot. These aspects are important for the examination timetabling so it can be done in a smooth way and no student can sit more than one exam in a same time slot.

Item Type: Thesis (Masters)
Uncontrolled Keywords: Tabu Search, FAS Examination Timetabling
Subjects: Q Science > QA Mathematics > QA299.6-433 Analysis
Divisions: College of Arts and Sciences (CAS)
Depositing User: Mr Husni Ismail
Date Deposited: 19 Oct 2009 08:23
Last Modified: 24 Jul 2013 12:07
URI: http://etd.uum.edu.my/id/eprint/486

Actions (login required)

View Item View Item