An application of graph coloring to a scheduling problem
Loading...
Authors
Mack, Jacob A., III
Subjects
Advisors
Kodres, U.R.
Date of Issue
1968-06
Date
Publisher
Monterey, California. Naval Postgraduate School
Language
en_US
Abstract
A class scheduling problem is formulated as a graph coloring problem, A computer program based on an algorithm 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 acceptable schedule in this application, the results indicate that improvements in the coloring algorithm may yield acceptable schedules.
Type
Thesis
Description
Series/Report No
Department
Mathematics