Skip to main content
SpringerLink
Log in

Constraints of Availability in Timetabling and Scheduling

  • Conference paper
Practice and Theory of Automated Timetabling IV (PATAT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2740))

  • 1411 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. Asratian, A.S., Kamalian, R.R.: Interval Edge Coloring of Multigraphs. Appl. Math. Yerevan University 5, 21–34 (1987) (in Russian)

    Google Scholar 

  3. Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)

    MATH  Google Scholar 

  4. Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  5. Carter, M.W., Tovey, C.A.: When Is the Classroom Assignment Problem Hard? Oper. Res. 40 (suppl. 1), S28–S39 (1996)

    Article  Google Scholar 

  6. Costa, M.-C., de Werra, D., Picouleau, C.: On Some Image Reconstruction Problems (2002) (submitted)

    Google Scholar 

  7. Even, S., Itai, A., Shamir, A.: On the Complexity of Timetable and Multicommodity Flow Problems. SIAM J. Comput. 5, 691–703 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  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. 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)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. École Polytechnique Fédérale de Lausanne, Lausanne, 1015, Switzerland

    Dominique de Werra

Authors
  1. Dominique de Werra
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund Burke

  2. Information Technology, KaHo St-Lieven, Gebr. Desmetstraat 1, 9000, Gent, Belgium

    Patrick De Causmaecker

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Werra, D. (2003). Constraints of Availability in Timetabling and Scheduling. In: Burke, E., De Causmaecker, P. (eds) Practice and Theory of Automated Timetabling IV. PATAT 2002. Lecture Notes in Computer Science, vol 2740. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45157-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45157-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40699-0

  • Online ISBN: 978-3-540-45157-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation