Abstract
Different models have been proposed to tackle school timetabling problems [2]. In this paper we will concentrate on some types of constraints; our aim will be to show how these requirements may be handled in a graph theoretical model and more precisely in an edge coloring model. We will deal with some constraints of non-compactness which are usually important in the problems of S.Ex (i.e. scheduling of exams). Also several requirements of compactness will be taken into account.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. BRELAZ, Y. NICOLIER, D. DE WERRA, Compactness and Balancing in Scheduling, EPFL, O.R. Report 13. March 1975
W. JUNGINGER, Zurückführung des Studenplanproblems auf ein dreidimensionales Transportproblem, Z.O.R., vol. 16, 1972, P 11–25
D. DE WERRA, Balanced Schedules. INFOR J., vol. 9. No.3, 1971, P 230–237
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Physica-Verlag, Rudolf Liebing KG, Würzburg
About this paper
Cite this paper
de Werra, D. (1976). Everything you always wanted to know about S. Ex. In: Kohlas, J., Seifert, O., Stähly, P., Zimmermann, HJ. (eds) Proceedings in Operations Research 5. Vorträge der Jahrestagung 1975 DGOR / SVOR, vol 1975. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-99748-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-99748-8_17
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-0165-1
Online ISBN: 978-3-642-99748-8
eBook Packages: Springer Book Archive