IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-77903-2_61.html
   My bibliography  Save this book chapter

Relational Construction of Specific Timetables

In: Operations Research Proceedings 2007

Author

Listed:
  • Rudolf Berghammer

    (Universität Kiel)

  • Britta Kehden

    (Universität Kiel)

Abstract

We use relation algebra to model an abstract timetabling problem and to compute solutions. The problem was posed to us by the administration of our university and stems from the current change from the classical German university education system to the undergraduate-graduate system. In particular with regard to the undergraduate education of secondary school teachers this change causes some difficulties. A very serious one is to enable a three years duration of study without to abolish Germany’s tradition of (at least) two different fields of study. Exactly this demand is the background of our specific university timetabling problem. We will show how to transform an informal problem description into a formal relation-algebraic model. Using it as starting point, we then develop an algorithm for obtaining solutions. In essence the algorithm is given by a relation-algebraic expression that immediately can be translated into the programming language of the RelView tool. Because of the moderate size of the timetabling problem and the very efficient BDD-implementation of relations in RelView, this even allows to compute all existing solutions of the problem or to message that no solution exists. Due to space restrictions we omit many details. This material will be included in [3].

Suggested Citation

  • Rudolf Berghammer & Britta Kehden, 2008. "Relational Construction of Specific Timetables," Operations Research Proceedings, in: Jörg Kalcsics & Stefan Nickel (ed.), Operations Research Proceedings 2007, pages 397-402, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-77903-2_61
    DOI: 10.1007/978-3-540-77903-2_61
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-540-77903-2_61. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.