Advertisement

Constraints of Availability in Timetabling and Scheduling

  • Dominique de Werra
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2740)

Abstract

The basic class–teacher timetabling problem is examined with the additional constraints due to the (un-)availability of source teachers and/or classes at some periods. We mention a generalization of this problem which occurs in image reconstruction problems in tomography. Complexity issues are discussed for both types of problems and some solvable cases are presented which can be derived from the image reconstruction formulation. Reductions to canonical forms are also described. Some other types of unavailability constraints (for classrooms or for lectures) are also reviewed.

Keywords

Polynomial Time Bipartite Graph Multiple Edge Parallel Edge Open Shop 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Asratian, A.S., de Werra, D.: A Generalized Class–Teacher Model for Some Timetabling Problems. Eur. J. Oper. Res. (2002) (to appear)Google Scholar
  2. 2.
    Asratian, A.S., Kamalian, R.R.: Interval Edge Coloring of Multigraphs. Appl. Math. Yerevan University 5, 21–34 (1987) (in Russian) Google Scholar
  3. 3.
    Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)zbMATHGoogle Scholar
  4. 4.
    Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer, Heidelberg (1996)zbMATHGoogle Scholar
  5. 5.
    Carter, M.W., Tovey, C.A.: When Is the Classroom Assignment Problem Hard? Oper. Res. 40 (suppl. 1), S28–S39 (1996)CrossRefGoogle Scholar
  6. 6.
    Costa, M.-C., de Werra, D., Picouleau, C.: On Some Image Reconstruction Problems (2002) (submitted) Google Scholar
  7. 7.
    Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5, 691–703 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Gabow, T., Nishizeki, O., Kariv, D., Leven, O., Terada, O.: Algorithms for Edge-Coloring Graphs. University of Colorado, Boulder (1983) (unpublished manuscript)Google Scholar
  9. 9.
    Williamson, D.P., Hall, L.A., Hoogeven, J.A., Hurkens, C.A.J., Lenstra, J.K., Sevastianov, S.V., Shmoys, D.B.: Short Shop Schedules. Oper. Res. 45, 288–294 (1997)zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Dominique de Werra
    • 1
  1. 1.École Polytechnique Fédérale de LausanneLausanneSwitzerland

Personalised recommendations