The Complexity of Timetable Construction Problems

The Complexity of Timetable Construction Problems (0)

Cached

Download Links

[www.cs.su.oz.au]
[ftp.cs.su.oz.au]
[www.it.usyd.edu.au]

Other Repositories/Bibliography

DBLP

by Tim B. Cooper , Jeffrey H. Kingston

Venue:	In Burke and Ross [BR96
Citations:	24 - 1 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Complexity of Timetable Construction Problems	user correction - Legacy Corrections
AUTHOR NAME	Tim B. Cooper	SVM HeaderParse 0.1
AUTHOR AFFIL	Basser Department of Computer Science; The University of Sydney	SVM HeaderParse 0.2
AUTHOR ADDR	Australia	SVM HeaderParse 0.1
AUTHOR NAME	Jeffrey H. Kingston	SVM HeaderParse 0.1
AUTHOR AFFIL	Basser Department of Computer Science; The University of Sydney	SVM HeaderParse 0.2
AUTHOR ADDR	Australia	SVM HeaderParse 0.1
ABSTRACT	This paper shows that timetable construction is NP-complete in a number of quite different ways that arise in practice, and discusses the prospects of overcoming these problems. A formal specification of the problem based on TTL, a timetable specification language, is given. Specificially, we show that NP-completeness arises whenever students have a wide subject choice, or meetings vary in duration, or simple conditions are imposed on the choice of times for meetings, such as requirements for double times or an even spread through the week. In realistic cases, the assignment of meetings to just one teacher (after their times are fixed) is NP-complete. And although suitable times can be assigned to all the meetings involving one student group simultaneously, the corresponding problem for two student groups is NP-complete. Keywords: timetable construction, specification, complexity. 1. Introduction The timetable construction problem is to assign times, teachers, students and rooms to a...	user correction - Legacy Corrections
YEAR	0	user correction - Legacy Corrections
VENUE	In Burke and Ross [BR96	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	283--295	INFERENCE
CITATIONS	10 found	ParsCit 1.0