Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Guide to Graph ColouringDesigning University Timetables

A Guide to Graph Colouring: Designing University Timetables [In this chapter, our final case study looks at how graph colouring concepts can be used in the construction of high-quality timetables for universities and other types of educational establishments. As we will see, this sort of problem can contain a whole host of different, and often idiosyncratic, constraints which will often make the problem very difficult to tackle. That said, most timetabling problems contain an underlying graph colouring problem, allowing us to use many of the concepts developed in previous chapters.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Guide to Graph ColouringDesigning University Timetables

Download PDF
26 pages

Loading next page...
 
/lp/springer-journals/a-guide-to-graph-colouring-designing-university-timetables-lu4vtLUx4s
Publisher
Springer International Publishing
Copyright
© Springer International Publishing Switzerland 2016
ISBN
978-3-319-25728-0
Pages
195 –221
DOI
10.1007/978-3-319-25730-3_8
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter, our final case study looks at how graph colouring concepts can be used in the construction of high-quality timetables for universities and other types of educational establishments. As we will see, this sort of problem can contain a whole host of different, and often idiosyncratic, constraints which will often make the problem very difficult to tackle. That said, most timetabling problems contain an underlying graph colouring problem, allowing us to use many of the concepts developed in previous chapters.]

Published: Oct 27, 2015

Keywords: Tabu Search; Problem Instance; Neighbourhood Operator; Ranking Score; Soft Constraint

There are no references for this article.