Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Constraints of Availability in Timetabling and Scheduling Read chapter Read first chapter

2003 | OriginalPaper | Chapter

Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem

Authors : David J. Abraham, Jeffrey H. Kingston

Published in: Practice and Theory of Automated Timetabling IV

Publisher: Springer Berlin Heidelberg

Included in: Professional Book Archive

Get Access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

In this paper we introduce a new algorithm for secondary school timetabling, inspired by the classical bipartite graph edge colouring algorithm for basic class–teacher timetabling. We give practical methods for generating large sets of meetings that can be timetabled to run simultaneously, and for building actual timetables based on these sets. We report promising empirical results for one real-world instance of the problem.

previous chapter Knowledge Discovery in a Hyper-heuristic for Course Timetabling Using Case-Based Reasoning
next chapter Flow Formulations for the Student Scheduling Problem
Metadata
Title
Generalizing Bipartite Edge Colouring to Solve Real Instances of the Timetabling Problem
Authors
David J. Abraham
Jeffrey H. Kingston
Copyright Year
2003
Publisher
Springer Berlin Heidelberg
Book
Practice and Theory of Automated Timetabling IV

Print ISBN: 978-3-540-40699-0

Electronic ISBN: 978-3-540-45157-0

Copyright Year: 2003

DOI
https://doi.org/10.1007/978-3-540-45157-0_19

Premium Partner

    Image Credits