Paper Info
Title
Resource assignment in high school timetabling.
Abstract
This paper explores one aspect of the high school timetabling problem, namely the assignment of resources, such as teachers and rooms, to meetings after times are assigned. Several algorithms, with run times of just a few seconds, are presented and tested on real-world data. The best of these is currently in operation within KTS, a free, public web site for high school timetabling created by the author. A large bipartite matching model, called the , is used to preserve optimality of one key measure of quality as resource assignment proceeds.
Year
DOI
Venue
2012
10.1007/s10479-010-0695-0
Annals OR
Keywords
Field
DocType
Time Assignment,Demand Node,Resource Assignment,Supply Node,Automate Timetabling
Computer science,Bipartite graph,Resource assignment,Operations research,Timetabling problem,Web site
Journal
Volume
Issue
ISSN
194
1
0254-5330
Citations 
PageRank 
References 
7
0.78
6
Authors
1
Name
Order
Citations
PageRank
Jeffrey H. Kingston133638.79