Examination Timetable Scheduling Using Tabu Search

• 第一著者: Almabrok, Mohammed Saad
• フォーマット: 学位論文
• 言語: English; English
• 出版事項: 2008
• 主題: QA299.6-433 Analysis
• オンライン･アクセス: http://etd.uum.edu.my/486/1/Mohammed_Saad_Almabrok.pdf; http://etd.uum.edu.my/486/2/Mohammed_Saad_Almabrok.pdf; http://etd.uum.edu.my/486/

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.