Optimasi Penjadwalan Kuliah Dengan Metode Tabu Search

Abstract

The problem of university timetableing is how to formulate the best combination for the pair of courses, lecturers, availability of appropriate classrooms and other supporting facilities, without breaking any regulations and conditions. There are two classes of constraints in university timetabling: hard constraints which should be fulfilled, and soft constraints which can either be completely or partly fulfilled. A schedule is valid if none of the constraints is violated. Soft constraints, although are not required to be entirely fulfilled, yet should as much as possible be fulfilled by the schedule. In this project, the problems of university schedule is formulated using tabu search methods, which is a heuristic method based on local search. It works by choosing the best solution of current best solutions of neighborhood that does not belong to the forbidden solutions (tabu). The results obtained show that asumptions and regulations about class size and value measurement of each subject category influence the effectivity and efficiency of schedule formulation.