Skip to main content
SpringerLink
Log in

Towards a reference model for timetabling and rostering

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

Timetabling and rostering research often starts from particular real world problems. The last two decennia have seen a large number of papers discussing cases, models and approaches. This large body of publications does not presently constitute a structured domain that provides guidelines for addressing particular problem instances, nor does it allow identifying gaps where new research is needed.

In this paper, we instigate a structured model for timetabling and rostering. We present a basic structure for the integrated staff planning and rostering problem. The model can only result in a valid and efficient tool through the input of multiple disciplines. We give a first formal description for short term nurse rostering. Specific problems are positioned in this model.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Baaijens, C., van Doorne-Huiskes, J., & Schippers, J. (2005). Do dutch employees want to work more or less hours than they actually do? In B. Peper, J. van Doorne-Huiskes, & L. den Dulk (Eds.), Flexible working and organisational change: the integration of work and personal life. Cheltenham: Edgar Elgar.

    Google Scholar 

  • Bard, J. F., & Purnomo, H. W. (2004). Real-time scheduling for nurses in response to demand fluctuations and personnel shortages. In E. K. Burke & M. Trick (Eds.), Proceedings of the 5th international conference on the practice and theory of automated timetabling, PATAT (pp. 67–87). Pittsburgh, August 2004.

  • Bilgin, B., Özcan, E., & Korkmaz, E. E. (2007). An experimental study on hyper-heuristics and exam timetabling. In E. K. Burke, & H. Rudová (Eds.), Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI (pp. 394–412). Berlin: Springer.

    Chapter  Google Scholar 

  • Bilgin, B., De Causmaecker, P., Rossie, B., & Vanden Berghe, G. (2008). Local search neighbourhoods to deal with a novel nurse rostering mode. In Proceedings of the 7th international conference on practice and theory of automated timetabling. Montreal, August 2008.

  • Bourdais, S., Galinier, Ph., & Pesant, G. (2003). Hibiscus: A constraint programming application to staff scheduling in health care. In Lecture notes in computer science : Vol. 2833. CP 2003 (pp. 153–167). Berlin: Springer.

    Google Scholar 

  • Brucker, P. (2004). Scheduling algorithms (4th ed.). Berlin: Springer.

    Google Scholar 

  • Burke, E. K., Pepper, P. A., & Kingston, J. H. (1997). A standard data format for timetabling instances. In Lecture notes in computer science (Vol. 1408, pp. 213–222). Berlin: Springer.

  • Burke, E. K., Cowling, P., De Causmaecker, P., & Vanden Berghe, G. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15, 199–214. Special issue on Simulated Evolution and Learning.

    Article  Google Scholar 

  • Burke, E. K., Kendall, G., & Soubeiga, E. (2003). A tabu-search hyper-heuristic for timetabling and rostering. Journal of Heuristics, 9(6), 451–470.

    Article  Google Scholar 

  • Burke, E. K., De Causmaecker, P., Vanden Berghe, G., & Van Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441–499.

    Article  Google Scholar 

  • Burke, E. K., De Causmaecker, P., Petrovic, S., & Vanden Berghe, G. (2006). Metaheuristics for handling time interval coverage constraints in nurse scheduling. Applied Artificial Intelligence, 20(9), 743–766.

    Article  Google Scholar 

  • De Causmaecker, P., & Vanden Berghe, G. (2008). Categorisation of personnel rostering problems (Technical report). K.U.Leuven.

  • De Causmaecker, P., Custers, N., Demeester, P., & Vanden Berghe, G. (2005). Semantic components for timetabling. In Lecture notes in computer science : Vol. 3616. Practice and theory of automated timetabling V (pp. 17–33). Berlin: Springer.

    Chapter  Google Scholar 

  • De Causmaecker, P., Vanden Berghe, G., Baaijens, C., Gemmel, P., & Salomez, K. (2007). Workforce planning and scheduling: an integrated approach for health care (Technical report). K.U.Leuven.

  • De Causmaecker, P., Demeester, P., & Vanden Berghe, G. (2009). A decomposed meta-heuristic approach for a real-world university timetabling problem. European Journal of Operational Research, 195(1), 307–318.

    Article  Google Scholar 

  • De Cesco, F., Di Gaspero, L., & Schaerf, A. (2008). Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, and results. In Proceedings of the 7th international conference on practice and theory of automated timetabling. Montreal.

  • de Vries, G. (1987). Nursing workload measurement as management information. European Journal of Operational Research, 29, 199–208.

    Article  Google Scholar 

  • Easton, F., Rossin, D., & Borders, W. (1992). Analysis of alternative scheduling policies for hospital nurses. Production and Operations Management, 1(2), 159–174.

    Article  Google Scholar 

  • Gemmel, P., Vandaele, D., & Tambeur, W. (2008). Hospital process orientation (hpo): the development of a measurement tool. Total Quality Management and Business Excellence, 19(12), 1207–1217.

    Article  Google Scholar 

  • Glass, C. A., & Knight, R. A. (2009). The nurse rostering problem: A critical appraisal of the problem structure. European Journal of Operational Research.

  • Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 4, 287–326.

    Article  Google Scholar 

  • Halldorsson, A., Kotzab, H., Mikkola, J. H., & Skjoett-Larsen, T. (2007). Complementary theories to supply chain management. Supply Chain Management: An International Journal, 12(4), 284–296.

    Article  Google Scholar 

  • Haspeslagh, S., Messelis, T., Bilgin, B., De Causmaecker, P., & Vanden Berghe, G. (2009). Hardness studies on rostering problems (Technical report). K.U.Leuven and KaHo Sint-Lieven.

  • Ho, W. K., Lim, A., & Oon, W. C. (2001). Maximizing paper spread in examination timetabling using a vehicle routing method. In Proceedings of 13th IEEE international conference on tools with artificial intelligence (pp. 359–366).

  • Kellogg, D. L., & Walczak, S. (2007). Nurse scheduling: From academia to implementation or not? Interfaces, 37(4), 355–369.

    Article  Google Scholar 

  • Kingston, J. H. (2001). Modeling timetabling problems with sttl. In E. K. Burke, & W. Erben (Eds.), Lecture notes in computer science : Vol. 2079. Practice and theory of automated timetabling II (pp. 309–321). Berlin: Springer.

    Chapter  Google Scholar 

  • Kingston, J. H. (2005). A tiling algorithm for high school timetabling. In M. Trick, & E. K Burke (Eds.), Lecture notes in computer science : Vol. 3616. Practice and theory of automated timetabling V (pp. 208–225). Berlin: Springer.

    Chapter  Google Scholar 

  • Leyton-Brown, K., Nudelman, E., & Shoham, Y. (2002). Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In Constraint programming (CP) (pp. 556–572).

  • McCollum, B. (2007). A perceptive on bridging the gap between theory and practice in university timetabling. In E. K. Burke, & H. Rudová (Eds.), Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI (pp. 3–23). Berlin: Springer.

    Chapter  Google Scholar 

  • Messelis, T., Haspeslagh, S., Bilgin, B., De Causmaecker, P., & Vanden Berghe, G. (2009). Towards prediction of algorithm performance in real world optimisation problems. In Proceedings of the 21st Benelux conference on artificial intelligence, number 21 in BNAIC, Eindhoven, October 2009.

  • Meyer auf’m Hofe, H. (2001). Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 57, 67–99.

    Google Scholar 

  • Özcan, E. (2003). Towards an xml based standard for timetabling problems: Ttml. In G. Kendall, E. K. Burke, & S. Petrovic (Eds.), Proceedings of the 1st multidisciplinary international conference on scheduling: theory and applications, MISTA2003 (pp. 566–569).

  • Petrovic, S., & Vanden Berghe, G. (2008). Comparison of algorithms for nurse rostering problems. In Proceedings of the 7th international conference on practice and theory of automated timetabling, Montreal.

  • Petrovic, S., Beddoe, G., & Vanden Berghe, G. (2003). Storing and adapting repair experiences in personnel rostering. In E. K. Burke, & P. De Causmaecker (Eds.), Lecture notes in computer science : Vol. 2740. Practice and theory of automated timetabling IV (pp. 148–165). Berlin: Springer.

    Chapter  Google Scholar 

  • Pinedo, M. L. (2006). Springer series in operations research. Planning and scheduling in manufacturing and services. Berlin: Springer.

    Google Scholar 

  • Qu, R. Burke, E. K., McCollum, B., Merlot, L. T., & Lee, S. Y. (2009). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12(1), 55–89.

    Article  Google Scholar 

  • Ranson, D., & Ahmadi, S. (2007). An extensible modelling framework for timetabling problems. In E. K. Burke, & H. Rudová (Eds.), Practice and theory of automated timetabling VI (Vol. 3867, pp. 383–393). Berlin: Springer.

    Chapter  Google Scholar 

  • Ryckbosch, F., Vanden Berghe, G., & Kendall, G. (2008). A heuristic approach for the travelling tournament problem using optimal travelling salesman tours. In Proceedings of the 7th international conference on practice and theory of automated timetabling. Montreal.

  • Schaerf, A., & Di Gaspero, L. (2007). Measurability and reproducibility in university timetabling research. In E. K. Burke, & H. Rudová (Eds.), Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI (pp. 40–49). Berlin: Springer.

    Chapter  Google Scholar 

  • Thompson, J., & Dowsland, K. (1996). Variants of simulated annealing for the examination timetabling problem. Annals of Operational Research, 63, 105–128.

    Article  Google Scholar 

  • Tien, J., & Kamiyama, A. (1982). On manpower scheduling algorithms. Society for Industrial and Applied Mathematics, 24(3), 275–287.

    Google Scholar 

  • Vanhoucke, M., & Maenhout, B. (2009). On the characterisation and generation of nurse scheduling problem instances. European Journal of Operational Research, 196(2), 457–467.

    Article  Google Scholar 

  • Warner, M. (1976). Scheduling nursing personnel according to nursing preference: A mathematical programming approach. Operations Research, 24.

  • Xu, L., Hoos, H. H., & Leyton-Brown, K. (2007). Hierarchical hardness models for sat. In Lecture notes in computer science : Vol. 4741. Principles and practice of constraint programming (CP-07) (pp. 696–711). Berlin: Springer.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CODeS, Computer Science KUL@K and Information Technology, K.U.Leuven, Campus Kortrijk, Etienne Sabbelaan 53, 8500, Kortrijk, Belgium

    Patrick De Causmaecker

  2. CODeS, Information Technology, KaHo Sint-Lieven, Gebroeders Desmetstraat 1, 9000, Gent, Belgium

    Greet Vanden Berghe

Authors
  1. Patrick De Causmaecker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Greet Vanden Berghe
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Patrick De Causmaecker.

Rights and permissions

Reprints and permissions

About this article

Cite this article

De Causmaecker, P., Vanden Berghe, G. Towards a reference model for timetabling and rostering. Ann Oper Res 194, 167–176 (2012). https://doi.org/10.1007/s10479-010-0721-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-010-0721-2

Keywords

Search

Navigation