# RICE UNIVERSITY A Study of University Timetabling that Blends Graph Coloring with the Satisfaction of Various Essential and Preferential Conditions

@inproceedings{Redl2004RICEUA, title={RICE UNIVERSITY A Study of University Timetabling that Blends Graph Coloring with the Satisfaction of Various Essential and Preferential Conditions}, author={Timothy Anton Redl and A Thesis Submitted}, year={2004} }

- Published 2004

Constructing a satisfactory conflict-free semester-long timetable of courses and creating a similarly satisfactory conflict-free timetable for end-of-semester final examinations are two closely related and often difficultproblems that colleges and universities face each semester. We discuss the relevance of such timetabling problems as a natural and practical application of graph coloring, and develop a mathematical and computational model for solving university timetabling problems using… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 60 REFERENCES

## Simultaneous Satisfaction of Hard and Soft Timetable Constraints for a University Department Using E

VIEW 7 EXCERPTS

HIGHLY INFLUENTIAL

## Optimizing Timetabling Solutions Using Graph Coloring

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## A University Timetabling System Based on Graph Colouring and Constraint Manipulation

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## A graph coloring algorithm for large scheduling problems

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## Graph Coloring Conditions for the Existence of Solutions to the Timetable Problem

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## An upper bound for the chromatic number of a graph and its application to timetabling problems

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## A Language for Specifying Complete Timetabling Problems

VIEW 1 EXCERPT

## How to build an interference graph

VIEW 1 EXCERPT