Chromatic Scheduling and the Chromatic Number Problem

J. Randall Brown
Additional contact information
J. Randall Brown: Kent State University

Management Science, 1972, vol. 19, issue 4-Part-1, 456-463

Abstract: The chromatic scheduling problem may be defined as any problem in which the solution is a partition of a set of objects. Since the partitions may not be distinct, redundant solutions can be generated when partial enumeration techniques are applied to chromatic scheduling problems. The necessary theory is developed to prevent redundant solutions in the application of partial enumeration techniques to chromatic scheduling problems with indistinguishable partitions and distinct objects. The chromatic number problem, which is the problem of finding the chromatic number of any graph, is a particular case of the chromatic scheduling problem. Two algorithms, basic and look-ahead, are developed for the chromatic number problem. Computational experience is given for each algorithm.

Date: 1972
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.19.4.456 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:19:y:1972:i:4-part-1:p:456-463

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().