Everything you always wanted to know about S. Ex

  • D. de Werra
Conference paper
Part of the Vorträge der Jahrestagung 1975 DGOR / SVOR book series (ORP, volume 1975)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    D. BRELAZ, Y. NICOLIER, D. DE WERRA, Compactness and Balancing in Scheduling, EPFL, O.R. Report 13. March 1975Google Scholar
  2. [2).
    W. JUNGINGER, Zurückführung des Studenplanproblems auf ein dreidimensionales Transportproblem, Z.O.R., vol. 16, 1972, P 11–25CrossRefGoogle Scholar
  3. [3]
    D. DE WERRA, Balanced Schedules. INFOR J., vol. 9. No.3, 1971, P 230–237Google Scholar

Copyright information

© Physica-Verlag, Rudolf Liebing KG, Würzburg 1976

Authors and Affiliations

  • D. de Werra
    • 1
  1. 1.LausanneSwitzerland

Personalised recommendations