(1991) A study of graph coloring heuristics and its application to a time tabling problem in a registration and scheduling system. Masters thesis, King Fahd University of Petroleum and Minerals.
|
PDF
10196.pdf Download (3MB) | Preview |
Arabic Abstract
-
English Abstract
The Ministry of Education of Saudi Arabia has converted most high schools in the Kingdom to the semester-credit-system (SCS). Even though it is a sophisticated system, a number of problems arose with its implementation. Registration of students, scheduling of courses and examination scheduling are tedious tasks of the system to be carried out smoothly. In the first part of this work we design and implement a registration and examination scheduling system. The solution to scheduling uses graph coloring heuristics on the course conflict graph produced from the student registration file. Different variants of examination and time-tabling problems can be formulated as graph vertex coloring problems. In the second part of this work we present various heuristics to the NP-Hard coloring problem. We also introduce the concepts of node-splitting and node-spilling. These concepts are helpful in situations where a desired k-coloring is necessary, even if the problem instance does not admit a k-coloring. In the final part of the thesis we conduct a detailed empirical study of the efficiency and quality of various heuristics, and propose a hybrid algorithm that mimics the best heuristic for the given graph instance.
| Item Type: | Thesis (Masters) |
|---|---|
| Subjects: | Computer |
| Department: | College of Computing and Mathematics > Information and Computer Science |
| Committee Advisor: | Ghanta, Subbarao |
| Committee Members: | Shaikh, A. K. and Shafique, Muhammed |
| Depositing User: | Mr. Admin Admin |
| Date Deposited: | 22 Jun 2008 13:58 |
| Last Modified: | 01 Nov 2019 13:58 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/10196 |