The solution scheduling problems via operation research techniques in production and service planning : An application over the optimisation of course and examination timetables

The aim of this research, first of all, is to reveal the importance of production scheduling and timetabling problems in production and service planning by examining the solution methods of these problems, to build up a computer program which provides the automatic constitution of lecture and examination schedules, each being a problem of timetabling.Paralel to this aim; in the first chapter of this research; types of scheduling problems and methods used in solving these problems are examined. Similarly, the place and importance of timetabling in service planning and the place and importance of lesson and examination schedules, each being a timetabling problems in the course of education are examined.In the second chapter, a survey of literature on the definition, types, structure and adviced solutions of timetabling problems is presented. Following the survey of literature; solution algoritms which will be used in the application (genetic algorithms, greedy random adaptive search procedure, hill climbing algorithm, tabu search, simulated annealing algorithms) are examined in detail.In the third and last chapter of the research, a programme for solving the problem of course and examination schedules is developed for CBU, The Faculty of Administrative Sciences and Economics; and general information about the structure of the algorithm is presented. Following this aim, the constraints of the problem are defined and mathematical modelling it is constructed. A hybrid genetic algorithm using this model is developed and details are given. Lastly, by making the necessary restrictions for the 2007-2008 Spring term the programme is tested by an ideal configuration and results are evaluated.