{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T21:00:31Z","timestamp":1771275631693,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T00:00:00Z","timestamp":1267488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10479-010-0721-2","type":"journal-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T05:00:20Z","timestamp":1267419620000},"page":"167-176","source":"Crossref","is-referenced-by-count":14,"title":["Towards a reference model for timetabling and rostering"],"prefix":"10.1007","volume":"194","author":[{"given":"Patrick","family":"De\u00a0Causmaecker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greet","family":"Vanden\u00a0Berghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,3,2]]},"reference":[{"key":"721_CR1","volume-title":"Flexible working and organisational change: the integration of work and personal life","author":"C. Baaijens","year":"2005","unstructured":"Baaijens, C., van Doorne-Huiskes, J., & Schippers, J. (2005). Do\u00a0dutch 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."},{"key":"721_CR2","unstructured":"Bard, J. F., & Purnomo, H. W. (2004). Real-time scheduling for nurses in response to demand fluctuations and personnel shortages. In E.\u00a0K. Burke & M. Trick (Eds.), Proceedings of the 5th international conference on the practice and theory of automated timetabling, PATAT (pp. 67\u201387). Pittsburgh, August 2004."},{"key":"721_CR3","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/978-3-540-77345-0_25","volume-title":"Practice and theory of automated timetabling VI","author":"B. Bilgin","year":"2007","unstructured":"Bilgin, B., \u00d6zcan, E., & Korkmaz, E. E. (2007). An experimental study on hyper-heuristics and exam timetabling. In E. K. Burke, & H. Rudov\u00e1 (Eds.), Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI (pp. 394\u2013412). Berlin: Springer."},{"key":"721_CR4","unstructured":"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."},{"key":"721_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-3-540-45193-8_11","volume-title":"CP 2003","author":"S. Bourdais","year":"2003","unstructured":"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\u2013167). Berlin: Springer."},{"key":"721_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling algorithms (4th ed.). Berlin: Springer.","edition":"4"},{"key":"721_CR7","unstructured":"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\u2013222). Berlin: Springer."},{"key":"721_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E. K. Burke","year":"2001","unstructured":"Burke, E. K., Cowling, P., De Causmaecker, P., & Vanden Berghe, G. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15, 199\u2013214. Special issue on Simulated Evolution and Learning.","journal-title":"Applied Intelligence"},{"issue":"6","key":"721_CR9","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., Kendall, G., & Soubeiga, E. (2003). A tabu-search hyper-heuristic for timetabling and rostering. Journal of Heuristics, 9(6), 451\u2013470.","journal-title":"Journal of Heuristics"},{"issue":"6","key":"721_CR10","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E. K. Burke","year":"2004","unstructured":"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\u2013499.","journal-title":"Journal of Scheduling"},{"issue":"9","key":"721_CR11","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1080\/08839510600903841","volume":"20","author":"E. K. Burke","year":"2006","unstructured":"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\u2013766.","journal-title":"Applied Artificial Intelligence"},{"key":"721_CR12","unstructured":"De Causmaecker, P., & Vanden Berghe, G. (2008). Categorisation of personnel rostering problems (Technical report). K.U.Leuven."},{"key":"721_CR13","series-title":"Lecture notes in computer science","first-page":"17","volume-title":"Practice and theory of automated timetabling V","author":"P. Causmaecker De","year":"2005","unstructured":"De Causmaecker, P., Custers, N., Demeester, P., & Vanden\u00a0Berghe, G. (2005). Semantic components for timetabling. In Lecture notes in computer science : Vol. 3616. Practice and theory of automated timetabling V (pp. 17\u201333). Berlin: Springer."},{"key":"721_CR14","unstructured":"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."},{"issue":"1","key":"721_CR15","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.ejor.2008.01.043","volume":"195","author":"P. Causmaecker De","year":"2009","unstructured":"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\u2013318.","journal-title":"European Journal of Operational Research"},{"key":"721_CR16","unstructured":"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."},{"key":"721_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0377-2217(87)90110-X","volume":"29","author":"G. Vries de","year":"1987","unstructured":"de Vries, G. (1987). Nursing workload measurement as management information. European Journal of Operational Research, 29, 199\u2013208.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"721_CR18","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1111\/j.1937-5956.1992.tb00349.x","volume":"1","author":"F. Easton","year":"1992","unstructured":"Easton, F., Rossin, D., & Borders, W. (1992). Analysis of alternative scheduling policies for hospital nurses. Production and Operations Management, 1(2), 159\u2013174.","journal-title":"Production and Operations Management"},{"issue":"12","key":"721_CR19","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1080\/14783360802351488","volume":"19","author":"P. Gemmel","year":"2008","unstructured":"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\u20131217.","journal-title":"Total Quality Management and Business Excellence"},{"key":"721_CR20","unstructured":"Glass, C. A., & Knight, R. A. (2009). The nurse rostering problem: A critical appraisal of the problem structure. European Journal of Operational Research."},{"key":"721_CR21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"R. L. Graham","year":"1979","unstructured":"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\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"4","key":"721_CR22","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1108\/13598540710759808","volume":"12","author":"A. Halldorsson","year":"2007","unstructured":"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\u2013296.","journal-title":"Supply Chain Management: An International Journal"},{"key":"721_CR23","unstructured":"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."},{"key":"721_CR24","unstructured":"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\u2013366)."},{"issue":"4","key":"721_CR25","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1287\/inte.1070.0291","volume":"37","author":"D. L. Kellogg","year":"2007","unstructured":"Kellogg, D. L., & Walczak, S. (2007). Nurse scheduling: From academia to implementation or not? Interfaces, 37(4), 355\u2013369.","journal-title":"Interfaces"},{"key":"721_CR26","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/3-540-44629-X_19","volume-title":"Practice and theory of automated timetabling II","author":"J. H. Kingston","year":"2001","unstructured":"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\u2013321). Berlin: Springer."},{"key":"721_CR27","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/11593577_13","volume-title":"Practice and theory of automated timetabling V","author":"J. H. Kingston","year":"2005","unstructured":"Kingston, J. H. (2005). A tiling algorithm for high school timetabling. In M. Trick, & E.\u00a0K Burke (Eds.), Lecture notes in computer science : Vol. 3616. Practice and theory of automated timetabling V (pp. 208\u2013225). Berlin: Springer."},{"key":"721_CR28","doi-asserted-by":"crossref","unstructured":"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\u2013572).","DOI":"10.1007\/3-540-46135-3_37"},{"key":"721_CR29","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-77345-0_1","volume-title":"Practice and theory of automated timetabling VI","author":"B. McCollum","year":"2007","unstructured":"McCollum, B. (2007). A perceptive on bridging the gap between theory and practice in university timetabling. In E. K. Burke, & H. Rudov\u00e1 (Eds.), Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI (pp. 3\u201323). Berlin: Springer."},{"key":"721_CR30","unstructured":"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."},{"key":"721_CR31","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1090\/dimacs\/057\/05","volume":"57","author":"H. Meyer auf\u2019m Hofe","year":"2001","unstructured":"Meyer auf\u2019m 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\u201399.","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"721_CR32","unstructured":"\u00d6zcan, E. (2003). Towards an xml based standard for timetabling problems: Ttml. In G. Kendall, E.\u00a0K. Burke, & S. Petrovic (Eds.), Proceedings of the 1st multidisciplinary international conference on scheduling: theory and applications, MISTA2003 (pp. 566\u2013569)."},{"key":"721_CR33","unstructured":"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."},{"key":"721_CR34","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-540-45157-0_10","volume-title":"Practice and theory of automated timetabling IV","author":"S. Petrovic","year":"2003","unstructured":"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\u2013165). Berlin: Springer."},{"key":"721_CR35","series-title":"Planning and scheduling in manufacturing and services","volume-title":"Springer series in operations research","author":"M. L. Pinedo","year":"2006","unstructured":"Pinedo, M. L. (2006). Springer series in operations research. Planning and scheduling in manufacturing and services. Berlin: Springer."},{"issue":"1","key":"721_CR36","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10951-008-0077-5","volume":"12","author":"R. Qu","year":"2009","unstructured":"Qu, R. Burke, E.\u00a0K., McCollum, B., Merlot, L.\u00a0T., & Lee, S.\u00a0Y. (2009). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12(1), 55\u201389.","journal-title":"Journal of Scheduling"},{"key":"721_CR37","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/978-3-540-77345-0_24","volume-title":"Practice and theory of automated timetabling VI","author":"D. Ranson","year":"2007","unstructured":"Ranson, D., & Ahmadi, S. (2007). An extensible modelling framework for timetabling problems. In E. K. Burke, & H. Rudov\u00e1 (Eds.), Practice and theory of automated timetabling VI (Vol.\u00a03867, pp. 383\u2013393). Berlin: Springer."},{"key":"721_CR38","unstructured":"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."},{"key":"721_CR39","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-540-77345-0_3","volume-title":"Practice and theory of automated timetabling VI","author":"A. Schaerf","year":"2007","unstructured":"Schaerf, A., & Di Gaspero, L. (2007). Measurability and reproducibility in university timetabling research. In E. K. Burke, & H. Rudov\u00e1 (Eds.), Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI (pp. 40\u201349). Berlin: Springer."},{"key":"721_CR40","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02601641","volume":"63","author":"J. Thompson","year":"1996","unstructured":"Thompson, J., & Dowsland, K. (1996). Variants of simulated annealing for the examination timetabling problem. Annals of Operational Research, 63, 105\u2013128.","journal-title":"Annals of Operational Research"},{"issue":"3","key":"721_CR41","first-page":"275","volume":"24","author":"J. Tien","year":"1982","unstructured":"Tien, J., & Kamiyama, A. (1982). On manpower scheduling algorithms. Society for Industrial and Applied Mathematics, 24(3), 275\u2013287.","journal-title":"Society for Industrial and Applied Mathematics"},{"issue":"2","key":"721_CR42","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.ejor.2008.03.044","volume":"196","author":"M. Vanhoucke","year":"2009","unstructured":"Vanhoucke, M., & Maenhout, B. (2009). On the characterisation and generation of nurse scheduling problem instances. European Journal of Operational Research, 196(2), 457\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"721_CR43","doi-asserted-by":"crossref","unstructured":"Warner, M. (1976). Scheduling nursing personnel according to nursing preference: A mathematical programming approach. Operations Research, 24.","DOI":"10.1287\/opre.24.5.842"},{"key":"721_CR44","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1007\/978-3-540-74970-7_49","volume-title":"Principles and practice of constraint programming (CP-07)","author":"L. Xu","year":"2007","unstructured":"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\u2013711). Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0721-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0721-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0721-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:00Z","timestamp":1559153280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0721-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,2]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["721"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0721-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,2]]}}}