The Application of a Graph Coloring Method to an Examination Scheduling Problem

Nirbhay K. Mehta
Additional contact information
Nirbhay K. Mehta: Department of Management Science, University of Detroit, Detroit, Michigan 48221

Interfaces, 1981, vol. 11, issue 5, 57-65

Abstract: This paper describes the application of a vertex coloring procedure to a real life examination scheduling problem. The accessories used in deriving and compressing the schedule and in rearranging the time frames to make the solution acceptable for the spring semester of 1980 are described.

Keywords: graphs: applications; education systems (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://dx.doi.org/10.1287/inte.11.5.57 (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:orinte:v:11:y:1981:i:5:p:57-65

Access Statistics for this article

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