Towards a reference model for timetabling and rostering

7th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2008

Volumn , Issue , 2008, Pages

  De Causmaecker, Patrick ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

REFERENCE MODELING; ROSTERING; SYSTEMATIC STUDY; TIMETABLING;

SCHEDULING;

EID: 84883116703     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Baaijens C., van Doorne-Huiskes J., Schippers J. 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, 2005
2. Bilgin B., Özcan E., Korkmaz E.E. An Experimental Study on Hyper-heuristics and Exam Timetabling. In Burke E. K., Rudová H. (eds.): Practice and Theory of Automated Timetabling VI, Selected Papers. Lecture Notes in Computer Science, Vol. 3867, Springer, Berlin (2007) 394-412.
3. Bourdais S., Galinier Ph., Pesant G.: HIBISCUS: A Constraint Programming Application to Staff Scheduling in Health Care, F. Rossi (Ed.): CP 2003, LNCS 2833, 153-167, 2003
4. P. Brucker (1998): Scheduling algorithms, 2nd edition, Springer, Heidelberg.
5. Burke E. K., Pepper P. A. and Kingston J. H., A Standard Data Format for Timetabling Instances, In Burke E.K., Carter M. (eds.) Lecture Notes in Computer Science, Vol. 1408, Springer, Berlin (1997) 213-222.
6. Burke E.K., Kendall G. and Soubeiga E. A Tabu-Search Hyper-Heuristic for Timetabling and Rostering. Journal of Heuristics, 9(6), 451-470, 2003
7. Burke E.K., De Causmaecker P., Vanden Berghe G., Van Landeghem H.: The State of the Art of Nurse Rostering, Journal of Scheduling, 2004, Vol. 7, No. 6, Nov/Dec 2004, 441-499
8. De Causmaecker P., Custers N., Demeester P., Vanden Berghe G.: Semantic Components for Timetabling, E.K. Burke, M. Trick (Eds), Revised Selected Papers of 5th International Conference on Practice and Theory of Automated Timetabling V, LNCS 3616, 2005, 17-33
9. De Causmaecker P., Vanden Berghe G., Baaijens C., Gemmel P., Salomez K.: Workforce Planning and Scheduling: an Integrated Approach for Health Care, K.U. Leuven working paper (2007).
10. De Causmaecker P., Demeester P., Vanden Berghe G.: A decomposed metaheuristic approach for a real-world university timetabling problem, European Journal of Operational Research, accepted for publication, 2008
11. De Causmaecker P., Vanden Berghe G., Haspeslagh S., Bilgin B., Messelis T., Categorisation of rostering problems for hardness studies, K.U. Leuven working paper (2008).
12. Gemmel P., Vandaele D., Tambeur W.: Hospital Process Orientation (HPO): the development of a measurement tool, accepted for publication in Total Quality Management and Business Excellence, vol.19, 2008.
13. R.L. Graham, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan (1979): Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann. Discrete Math. 4, 287-326
14. Halldorsson, A., Kotzab, H., Mikkola, J. H., Skjoett-Larsen, T. (2007). Complementary theories to supply chain management . Supply Chain Management: An International Journal, Volume 12 Issue 4, 284-296
15. Kingston J.H., Modeling timetabling problems with STTL, In Burke E. K., Erben W. (eds.): Practice and Theory of Automated Timetabling II, Selected Papers. Lecture Notes in Computer Science, Vol. 2079, Springer, Berlin (2001) 309, 2001.
16. Kingston J. H.: A Tiling Algorithm for High School Timetabling. In Burke E. K., Trick M. (eds.): Practice and Theory of Automated Timetabling V, Selected Papers. Lecture Notes in Computer Science, Vol. 3616, Springer, Berlin (2005) 208-225.
17. Leyton-Brown K., Nudelman E., Shoham Y. Learning the empirical hardness of optimization problems: The case of combinatorial auctions. In Constraint Programming (CP), pages 556-572, 2002.
18. A Perspecive on bridging the Gap Between Theory and Practice in University Timetabling. In Burke E. K., Rudová H. (eds.): Practice and Theory of Automated Timetabling VI, Selected Papers. Lecture Notes in Computer Science, Vol. 3867, Springer, Berlin (2007) 3-23
19. Özcan E., Towards an XML based standard for Timetabling Problems: TTML, Multidisciplinary Scheduling: Theory and Applications, Springer Verlag, 163 (24), May 2005.
20. Pinedo M. L., Planning and Scheduling in Manufacturing and Services, Springer Series in Operations Research, Springer Verlag 2006
21. Schaerf A., Di Gaspero L., Measurability and Reproducibility in University Timetabling Research. In Burke E. K., Rudová H. (eds.): Practice and Theory of Automated Timetabling VI, Selected Papers. Lecture Notes in Computer Science, Vol. 3867, Springer, Berlin (2007) 40-49
22. Vanhoucke M., Maenhout B.. Characterisation and generation of nurse scheduling problem instances. working paper, Gent, 2005.
23. Xu L., Hoos H.H., Leyton-Brown K.. Hierarchical hardness models for sat. In Principles and Practice of Constraint Programming (CP-07), Lecture Notes in Computer Science 4741, pages 696-711. Springer Berlin, 2007.