Skip to main content
SpringerLink
Log in

Off-the-peg or made-to-measure? timetabling and scheduling with SA and TS

  • Conference paper
  • First Online:
Practice and Theory of Automated Timetabling II (PATAT 1997)

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

Abstract

Modern heuristic search techniques such as simulated annealing (SA) and tabu search (TS) are particularly suited to solving problems with a mix of hard and soft constraints or hierarchies of objectives such as those commonly encountered in real-life timetabling and scheduling problems. However, it is well-known that such methods are sensitive to the way in which the problem is modelled within a local search framework and to the generic parameters used within the algorithm. This not only raises questions concerning the robustness of a particular implementation when faced with changes in data characteristics or problem specification but also casts doubt as to the extent to which features from a solution to one family of timetabling problems may be successfully incorporated into a solution to another. This paper examines these issues from a personal point of view and uses case-studies of scheduling, timetabling and staff-rostering problems arising in the education and hospital sectors to show that it is possible to design robust solutions based on SA and TS and that lessons learned when tackling one family of problems are frequently useful for another.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lundy, M. and Mees, A.: Convergence of an Annealing Algorithm. Mathematical Programming 34 (1986) 111–124

    Article  MATH  MathSciNet  Google Scholar 

  2. De Werra, D. and Hertz, A.: Tabu Search Techniques — a Tutorial and Application to Neural Networks. OR Spektrum 11 (1989) 131–141

    Article  MATH  Google Scholar 

  3. Wren, A.: Scheduling, Timetabling and Rostering — a Special Relationship? In: Burke, E. and Ross, P. (eds.): Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol 1153. Springer-Verlag (1996) 46–75

    Google Scholar 

  4. Robert, V., Hertz, A.: How to Decompose Constrained Course Scheduling Problems into Easier Assignment Type Sub-problems. In: Burke, E. and Ross, P. (eds.): Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol 1153. Springer-Verlag (1996) 364–373.

    Google Scholar 

  5. Boufflet, J.P., Négre, S.: Three methods used to solve an examination timetable problem. In: Burke, E. and Ross, P. (eds.): Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol 1153. Springer-Verlag (1996) 327–344

    Google Scholar 

  6. Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines. John Wiley and Sons (1989)

    Google Scholar 

  7. Eglese, R.W.: Simulated Annealing: a Tool for Operational Research. European Journal of Operational Research 46 (1990) 271–281

    Article  MATH  MathSciNet  Google Scholar 

  8. Dowsland, K.A. Simulated Annealing. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems. Blackwell (1993) 20–69.

    Google Scholar 

  9. Eiselt, H.A., Laporte, G.: Combinatorial Optimisation Problems with Soft and Hard Requirements. Journal of the Operational Research Society 38 (1987) 785–795.

    Article  MATH  Google Scholar 

  10. Abramson, D.: Constructing School Timetables Using Simulated Annealing: Sequential and Parallel Algorithms. Management Science 37 (1991) 98–113

    Article  Google Scholar 

  11. Dige, P., Lund, C., Ravn, H.F.: Timetabling by Simulated Annealing. In: Vidal, R.V.V. (ed.) Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, Vol 396. Springer (1993) 104–124.

    Google Scholar 

  12. Wright, M.: School Timetabling Using Heuristic Search. Journal of the Operational Research Society 47 (1996) 347–357

    Article  Google Scholar 

  13. Thompson J.M., Dowsland, K.A.: Variants of Simulated Annealing for the Examination Timetabling Problem. Annals of Operations Research 63 (1996) 105–128

    MATH  Google Scholar 

  14. Hertz, A.: Tabu Search for Large Scale Timetabling Problems. European Journal of Operational Research 54 (1991) 39–47

    Article  MATH  Google Scholar 

  15. Wright, M.: Timetabling County Cricket Fixtures Using a Form of Tabu Search. Journal of the Operational Research Society 45 (1994) 758–770

    Article  Google Scholar 

  16. Wright, M.: Scheduling English Cricket Umpires. Journal of the Operational Research Society 42 (1991) 447–452.

    Article  Google Scholar 

  17. Costa, D.: An Evolutionary Tabu Search Algorithm and the NHL Scheduling Problem INFOR 33 (1995) 161–178

    MATH  Google Scholar 

  18. Thompson, G.M.: A Simulated Annealing Heuristic for Shift Scheduling Using Non-continuously Available Employees’, Computers and Operations Research 23 (1996) 275–288

    Article  MATH  Google Scholar 

  19. Brusco, M.J., Jacobs, L.W.: A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems. Journal of the Operational Research Society 44 (1993) 1191–1200

    Article  MATH  Google Scholar 

  20. Dowsland, K.A.: Using Simulated Annealing for Efficient Allocation of Students to Practical Classes. In: Vidal, R.V.V. (ed.) Applied Simulated Annealing, Lecture Notes in Economics and Mathematical Systems, Vol. 396. Springer (1993) 125–150

    Google Scholar 

  21. Dowsland, K.A.: Simulated Annealing Solutions for Multi-objective Scheduling and Timetabling Problems. In: Rayward-Smith, V.J., Osman, I.H., Reeves, C.R., Smith, G.D. (eds.). Modern Heuristic Search Methods John Wiley (1996) 155–167

    Google Scholar 

  22. Thompson, J.M., Dowsland, K.A.: General Cooling Schedules for a Simulated Annealing Based Timetabling System. In: Burke, E. and Ross, P. (eds.): Practice and Theory of Automated Timetabling, Lecture Notes in Computer Science, Vol 1153. Springer-Verlag (1996) 345–363.

    Google Scholar 

  23. Dowsland, K.A.: Nurse scheduling with tabu search and strategic oscillation. European Journal of Operational Research (1998) (to appear).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. European Business Management School, University of Wales Swansea, SA2 8PP, UK

    Kathryn A. Dowsland

Authors
  1. Kathryn A. Dowsland
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Edmund Burke Michael Carter

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dowsland, K.A. (1998). Off-the-peg or made-to-measure? timetabling and scheduling with SA and TS. In: Burke, E., Carter, M. (eds) Practice and Theory of Automated Timetabling II. PATAT 1997. Lecture Notes in Computer Science, vol 1408. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055880

Download citation

  • DOI: https://doi.org/10.1007/BFb0055880

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64979-3

  • Online ISBN: 978-3-540-49803-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation