{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:32:41Z","timestamp":1786980761906,"version":"build-2736575974"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T00:00:00Z","timestamp":1452124800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10479-015-2094-z","type":"journal-article","created":{"date-parts":[[2016,1,6]],"date-time":"2016-01-06T20:55:14Z","timestamp":1452113714000},"page":"283-304","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Integer programming for minimal perturbation problems in university course timetabling"],"prefix":"10.1007","volume":"252","author":[{"given":"Antony E.","family":"Phillips","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cameron G.","family":"Walker","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthias","family":"Ehrgott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David M.","family":"Ryan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,1,7]]},"reference":[{"key":"2094_CR1","doi-asserted-by":"publisher","unstructured":"\u00c1sgeirsson, E. (2012). Bridging the gap between self schedules and feasible schedules in staff scheduling. Annals of Operations Research, 218(1), 51\u201369. doi:\n                        10.1007\/s10479-012-1060-2\n                        \n                    .","DOI":"10.1007\/s10479-012-1060-2"},{"key":"2094_CR2","doi-asserted-by":"publisher","unstructured":"Bart\u00e1k, R., M\u00fcller, T., & Rudov\u00e1, H. (2004). A new approach to modeling and solving minimal perturbation problems. In K. R. Apt, F. Fages, F. Rossi, P. Szeredi, & J. V\u00e1ncza (Eds.), Recent advances in constraints. Lecture notes in computer science (Vol. 3010, pp. 233\u2013249). Berlin: Springer.","DOI":"10.1007\/978-3-540-24662-6_13"},{"issue":"1","key":"2094_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1057\/palgrave.jors.2602523","volume":"60","author":"C Beyrouthy","year":"2007","unstructured":"Beyrouthy, C., Burke, E. K., Landa-Silva, D., McCollum, B., McMullan, P., & Parkes, A. J. (2007). Towards improving the utilization of university teaching space. Journal of the Operational Research Society, 60(1), 130\u2013143.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"2094_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10479-010-0707-0","volume":"194","author":"A Bonutti","year":"2012","unstructured":"Bonutti, A., De Cesco, F., Di Gaspero, L., & Schaerf, A. (2012). Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, visualization, and results. Annals of Operations Research, 194(1), 59\u201370.","journal-title":"Annals of Operations Research"},{"key":"2094_CR5","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2008). Uses and abuses of MIP in course timetabling. In Poster at the workshop on mixed integer programming, MIP2007, Montr\u00e9al, 2008. \n                        http:\/\/cs.nott.ac.uk\/jxm\/timetabling\/mip2007-poster.pdf\n                        \n                    ."},{"issue":"4","key":"2094_CR6","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"5","author":"H Sakkout El","year":"2000","unstructured":"El Sakkout, H., & Wallace, M. (2000). Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 5(4), 359\u2013388.","journal-title":"Constraints"},{"key":"2094_CR7","unstructured":"El Sakkout, H., Richards, T., & Wallace, M. (1998). Minimal perturbation in dynamic scheduling. In H. Prade (Ed.), Proceedings of the 13th European Conference on Artifical Intelligence, ECAI-98."},{"key":"2094_CR8","doi-asserted-by":"publisher","unstructured":"Fukunaga, A. (2013). An improved search algorithm for min-perturbation. In C. Schulte (Ed.), Principles and practice of constraint programming. Lecture notes in computer science (Vol. 8124, pp. 331\u2013339). Berlin: Springer.","DOI":"10.1007\/978-3-642-40627-0_27"},{"key":"2094_CR9","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-39304-4_4","volume-title":"Automated scheduling and planning, studies in computational intelligence","author":"JH Kingston","year":"2013","unstructured":"Kingston, J. H. (2013a). Educational timetabling. In A. S. Uyar, E. Ozcan, & N. Urquhart (Eds.), Automated scheduling and planning, studies in computational intelligence (Vol. 505, pp. 91\u2013108). Berlin: Springer."},{"key":"2094_CR10","doi-asserted-by":"publisher","unstructured":"Kingston, J. H. (2013b). Repairing high school timetables with polymorphic ejection chains. Annals of Operations Research, 1\u201316. doi:\n                        10.1007\/s10479-013-1504-3\n                        \n                    .","DOI":"10.1007\/s10479-013-1504-3"},{"key":"2094_CR11","doi-asserted-by":"publisher","unstructured":"McCollum, B. (2007). A perspective on bridging the gap between theory and practice in university timetabling. In E. K. Burke, & H. Rudov\u00e1 (Eds.), Practice and theory of automated timetabling VI. Lecture notes in computer science (Vol. 3867, pp. 3\u201323). Berlin: Springer.","DOI":"10.1007\/978-3-540-77345-0_1"},{"key":"2094_CR12","doi-asserted-by":"publisher","unstructured":"M\u00fcller, T., Rudov\u00e1, H., & Bart\u00e1k, R. (2005). Minimal perturbation problem in course timetabling. In E. K. Burke, & M. Trick (Eds.), Practice and theory of automated timetabling V. Lecture notes in computer science (Vol. 3616, pp. 126\u2013146). Berlin: Springer.","DOI":"10.1007\/11593577_8"},{"key":"2094_CR13","unstructured":"Phillips, A. E., Walker, C. G., Ehrgott, M., & Ryan, D. M. (2014). Integer programming for minimal perturbation problems in university course timetabling. In E. Ozcan, E. K. Burke, & B. McCollum (Eds.), Practice and theory of automated timetabling X. Lecture notes in computer science (pp. 366\u2013379)."},{"key":"2094_CR14","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.cor.2014.07.012","volume":"53","author":"AE Phillips","year":"2015","unstructured":"Phillips, A. E., Waterer, H., Ehrgott, M., & Ryan, D. M. (2015). Integer programming methods for large-scale practical classroom assignment problems. Computers and Operations Research, 53, 42\u201353.","journal-title":"Computers and Operations Research"},{"issue":"5","key":"2094_CR15","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.cor.2009.03.023","volume":"37","author":"NJ Rezanova","year":"2010","unstructured":"Rezanova, N. J., & Ryan, D. M. (2010). The train driver recovery problem\u2014A set partitioning based model and solution method. Computers and Operations Research, 37(5), 845\u2013856.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"2094_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10951-010-0171-3","volume":"14","author":"H Rudov\u00e1","year":"2011","unstructured":"Rudov\u00e1, H., M\u00fcller, T., & Murray, K. (2011). Complex university course timetabling. Journal of Scheduling, 14(2), 187\u2013207.","journal-title":"Journal of Scheduling"},{"issue":"3","key":"2094_CR17","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s10601-011-9108-5","volume":"16","author":"R Zivan","year":"2011","unstructured":"Zivan, R., Grubshtein, A., & Meisels, A. (2011). Hybrid search for minimal perturbation in dynamic CSPs. Constraints, 16(3), 228\u2013249.","journal-title":"Constraints"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2094-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2094-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2094-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2094-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:18Z","timestamp":1559138958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2094-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,7]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["2094"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2094-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,7]]}}}