Penalising Patterns in Timetables: Novel Integer Programming Formulations

  • Edmund K. Burke
  • Jakub Mareček
  • Andrew J. Parkes
  • Hana Rudová
Conference paper

DOI: 10.1007/978-3-540-77903-2_63

Part of the Operations Research Proceedings book series (ORP, volume 2007)
Cite this paper as:
Burke E.K., Mareček J., Parkes A.J., Rudová H. (2008) Penalising Patterns in Timetables: Novel Integer Programming Formulations. In: Kalcsics J., Nickel S. (eds) Operations Research Proceedings 2007. Operations Research Proceedings, vol 2007. Springer, Berlin, Heidelberg

Abstract

Many complex timetabling problems have an underpinning bounded graph colouring component, a pattern penalisation component and a number of side constraints. The bounded graph colouring component corresponds to hard constraints such as “students are in at most one place at one time” and “there is a limited number of rooms” [3]. Despite the hardness of graph colouring, it is often easy to generate feasible colourings. However, real-world timetabling systems [5] have to cope with much more challenging requirements, such as “students should not have gaps in their individual daily timetables”, which often make the problem over-constrained. The key to tackling this challenge is a suitable formulation of “soft” constraints, which count and minimise penalties incurred by matches of various patterns. Several integer programming formulations are presented and discussed in this paper.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Edmund K. Burke
    • 1
  • Jakub Mareček
    • 1
  • Andrew J. Parkes
    • 1
  • Hana Rudová
    • 2
  1. 1.Automated Scheduling, Optimisation and Planning GroupThe University of Nottingham School of Computer Science and ITNottinghamUK
  2. 2.Masaryk University Faculty of InformaticsBrnoThe Czech Republic

Personalised recommendations