Abstract
In this paper, we are concerned with a special timetabling problem. It was posed to us by the administration of our university and stems from the adoption of the British-American system of university education in Germany. This change led to the concrete task of constructing a timetable that enables the undergraduate education of secondary school teachers within three years in the “normal case” and within four years in the case of exceptional combinations of fields of study. We develop a relational model of the special timetabling problem and apply the RelView tool to compute solutions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Behnke, R., et al.: RelView – A system for calculation with relations and relational programming. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol. 1382, pp. 318–321. Springer, Heidelberg (1998)
Berghammer, R., Leoniuk, B., Milanese, U.: Implementation of relation algebra using binary decision diagrams. In: de Swart, H. (ed.) RelMiCS 2001. LNCS, vol. 2561, pp. 241–257. Springer, Heidelberg (2002)
Berghammer, R., Neumann, F.: RelView – An OBDD-based Computer Algebra system for relations. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol. 3718, pp. 40–51. Springer, Heidelberg (2005)
Gross, J.L., Yellen, J. (eds.): Handbook of graph theory. CRC Press, Boca Raton (2003)
Kehden, B.: Evaluating sets of search points using relational algebra. In: Schmidt, R.A. (ed.) RelMiCS/AKA 2006. LNCS, vol. 4136, pp. 266–280. Springer, Heidelberg (2006)
Kehden, B.: Vectors and vector predicates and their use in the development of relational algorithms (in German). Ph.D. thesis, Univ. of Kiel (to appear, 2008)
Schmidt, G., Ströhlein, T.: Some aspects in the construction of timetables. In: Rosenfeld, J.L. (ed.) Proc. IFIP Congress 1974, pp. 516–520. North Holland, Amsterdam (1974)
Schmidt, G., Ströhlein, T.: A Boolean matrix iteration in timetable construction. Lin. Algebra and Applications 15, 27–51 (1976)
Schmidt, G., Ströhlein, T.: Relations and graphs. Springer, Heidelberg (1993)
Tarski, A.: On the calculus of relations. J. Symbolic Logic 6, 73–89 (1941)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Berghammer, R., Kehden, B. (2008). Relation Algebra and RelView in Practical Use: Construction of Special University Timetables. In: Berghammer, R., Möller, B., Struth, G. (eds) Relations and Kleene Algebra in Computer Science. RelMiCS 2008. Lecture Notes in Computer Science, vol 4988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78913-0_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-78913-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78912-3
Online ISBN: 978-3-540-78913-0
eBook Packages: Computer ScienceComputer Science (R0)