Electronic Theses and Dissertations

Date of Award


Document Type


Degree Name

M.S. in Engineering Science


Computer and Information Science

First Advisor

Conrad Cunningham

Second Advisor

Conrad Cunningham

Third Advisor

Yixin Chen

Relational Format



Creating timetables for institutes which deal with transport, sport, workforce, courses, examination schedules, and healthcare scheduling is a complex problem. It is difficult and time consuming to solve due to many constraints. Depending on whether the constraints are essential or desirable they are categorized as ‘hard’ and ‘soft’, respectively. Two types of timetables, namely, course and examination are designed for academic institutes. A feasible course timetable could be described as a plan for the movement of students and staff from one classroom to another, without conflicts. Being an NP-complete problem, many attempts have been made using varying computational methods to obtain optimal solutions to the timetabling problem. Genetic algorithms, based on Darwin's theory of evolution is one such method. The aim of this study is to optimize a general university course scheduling process based on genetic algorithms using some defined constraints.


Emphasis: Computer Science



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.