An application of graph coloring to a scheduling problem
A class scheduling problem is formulated as a graph coloring problem, A computer program based on an algarithm recently developed by Welsh and Powell, Computer Journal, Vol, 10, May 1967, pp. 85-86, is used to obtain a solution to the coloring problem, While the program fails to provide an aece...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
Monterey, California. Naval Postgraduate School
2012
|
| Online Access: | http://hdl.handle.net/10945/11667 |
| Summary: | A class scheduling problem is formulated as a graph
coloring problem, A computer program based on an
algarithm recently developed by Welsh and Powell, Computer
Journal, Vol, 10, May 1967, pp. 85-86, is used to obtain a
solution to the coloring problem, While the program fails
to provide an aeceptgble schedule in this application, the
results indicate that improvements in the coloring algorithm
may yield acceptable schedules, |
|---|