{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T01:24:16Z","timestamp":1743643456737,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,12,23]],"date-time":"2015-12-23T00:00:00Z","timestamp":1450828800000},"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-2090-3","type":"journal-article","created":{"date-parts":[[2015,12,22]],"date-time":"2015-12-22T22:52:09Z","timestamp":1450824729000},"page":"305-333","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A multi-stage IP-based heuristic for class timetabling and trainer rostering"],"prefix":"10.1007","volume":"252","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9788-9189","authenticated-orcid":false,"given":"Oliver","family":"Czibula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanyu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aaron","family":"Russell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yakov","family":"Zinder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,23]]},"reference":[{"issue":"4","key":"2090_CR1","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1093\/comjnl\/16.4.347","volume":"16","author":"EA Akkoyunlu","year":"1973","unstructured":"Akkoyunlu, E. A. (1973). A linear algorithm for computing the optimum university timetable. The Computer Journal, 16(4), 347\u2013350.","journal-title":"The Computer Journal"},{"issue":"1","key":"2090_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/net.3230200103","volume":"20","author":"N Balakrishnan","year":"1990","unstructured":"Balakrishnan, N., & Wong, R. T. (1990). A network model for the rotating workforce scheduling problem. Networks, 20(1), 25\u201342.","journal-title":"Networks"},{"unstructured":"Birbas, T., Daskalaki, S., & Housos, E. (1997). Course and teacher scheduling in hellenic high schools. In 4th Balkan conference on operational research, Thessaloniki, Greece.","key":"2090_CR3"},{"issue":"2","key":"2090_CR4","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1016\/0377-2217(94)00350-5","volume":"92","author":"A B\u00f6lte","year":"1996","unstructured":"B\u00f6lte, A., & Thonemann, U. W. (1996). Optimizing simulated annealing schedules with genetic programming. European Journal of Operational Research, 92(2), 402\u2013416.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2090_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/08886504.1994.10782112","volume":"27","author":"E Burke","year":"1994","unstructured":"Burke, E., Elliman, D., & Weare, R. (1994). A university timetabling system based on graph colouring and constraint manipulation. Journal of Research on Computing in Education, 27(1), 1\u201318.","journal-title":"Journal of Research on Computing in Education"},{"issue":"2","key":"2090_CR6","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"EK Burke","year":"2002","unstructured":"Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140(2), 266\u2013280.","journal-title":"European Journal of Operational Research"},{"doi-asserted-by":"crossref","unstructured":"Carter, M. W., & Tovey, C. A. (1992). When is the classroom assignment problem hard? Operations Research, 40(1-supplement-1), S28\u2013S39.","key":"2090_CR7","DOI":"10.1287\/opre.40.1.S28"},{"doi-asserted-by":"publisher","unstructured":"Carter, M. W., Laporte, G., & Lee, S. Y. (1996). Examination timetabling: Algorithmic strategies and applications. Journal of the Operational Research Society, 373\u2013383.","key":"2090_CR8","DOI":"10.1057\/jors.1996.37"},{"issue":"3","key":"2090_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/opre.2.3.339","volume":"2","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G. B. (1954). Letter to the editor-a comment on edie\u2019s traffic delays at toll booths. Journal of the Operations Research Society of America, 2(3), 339\u2013341.","journal-title":"Journal of the Operations Research Society of America"},{"issue":"2","key":"2090_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D Werra de","year":"1985","unstructured":"de Werra, D. (1985). An introduction to timetabling. European Journal of Operational Research, 19(2), 151\u2013162.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2090_CR11","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/S0377-2217(00)00052-7","volume":"130","author":"M Dimopoulou","year":"2001","unstructured":"Dimopoulou, M., & Miliotis, P. (2001). Implementation of a university course and examination timetabling system. European Journal of Operational Research, 130(1), 202\u2013213.","journal-title":"European Journal of Operational Research"},{"key":"2090_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.cor.2014.06.023","volume":"52","author":"\u00c1P Dorneles","year":"2014","unstructured":"Dorneles, \u00c1. P., de Ara\u00fajo, O. C., & Buriol, L. S. (2014). A fix-and-optimize heuristic for the high school timetabling problem. Computers & Operations Research, 52, 29\u201338.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2090_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"AT Ernst","year":"2004","unstructured":"Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004). Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research, 153(1), 3\u201327.","journal-title":"European Journal of Operational Research"},{"unstructured":"Fischetti, M., & Widmayer, P. (2008). Towards solving very large scale train timetabling problems by lagrangian relaxation. In 8th workshop on algorithmic approaches for transportation modeling, optimization, and systems (ATMOS08) (Vol. 9).","key":"2090_CR14"},{"unstructured":"Gunawan, A., Ng, K., & Poh, K. (2008). A hybrid algorithm for the university course timetabling problem. In Proceedings of the 7th international conference on the practice and theory of automated timetabling.","key":"2090_CR15"},{"unstructured":"IBM. (2014). IBM CPLEX optimizer. http:\/\/www.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/ .","key":"2090_CR16"},{"unstructured":"IBM. (2015). IBM user\u2019s manual for CPLEX. ftp:\/\/public.dhe.ibm.com\/software\/websphere\/ilog\/docs\/optimization\/cplex\/ps_usrmancplex.pdf .","key":"2090_CR17"},{"issue":"2","key":"2090_CR18","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.ejor.2010.04.011","volume":"207","author":"MM Kahar","year":"2010","unstructured":"Kahar, M. M., & Kendall, G. (2010). The examination timetabling problem at universiti malaysia pahang: Comparison of a constructive heuristic with an existing software solution. European Journal of Operational Research, 207(2), 557\u2013565.","journal-title":"European Journal of Operational Research"},{"key":"2090_CR19","volume-title":"Reducibility among combinatorial problems","author":"RM Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. Berlin: Springer."},{"issue":"4","key":"2090_CR20","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1093\/comjnl\/12.4.307","volume":"12","author":"NL Lawrie","year":"1969","unstructured":"Lawrie, N. L. (1969). An integer linear programming model of a school timetabling problem. The Computer Journal, 12(4), 307\u2013316.","journal-title":"The Computer Journal"},{"issue":"1","key":"2090_CR21","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R Lewis","year":"2008","unstructured":"Lewis, R. (2008). A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum, 30(1), 167\u2013190.","journal-title":"OR Spectrum"},{"issue":"1\u20132","key":"2090_CR22","first-page":"11","volume":"48","author":"D Marx","year":"2004","unstructured":"Marx, D. (2004). Graph colouring problems and their applications in scheduling. Electrical Engineering, 48(1\u20132), 11\u201316.","journal-title":"Electrical Engineering"},{"issue":"5","key":"2090_CR23","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1287\/inte.11.5.57","volume":"11","author":"NK Mehta","year":"1981","unstructured":"Mehta, N. K. (1981). The application of a graph coloring method to an examination scheduling problem. Interfaces, 11(5), 57\u201365.","journal-title":"Interfaces"},{"unstructured":"Minerals Council of Australia. (2013). Training and education activity in the minerals sector. http:\/\/www.minerals.org.au\/file_upload\/files\/reports\/Final_Report_Minerals_Council_2013.pdf .","key":"2090_CR24"},{"issue":"8","key":"2090_CR25","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/361082.361092","volume":"17","author":"G Neufeld","year":"1974","unstructured":"Neufeld, G., & Tartar, J. (1974). Graph coloring conditions for the existence of solutions to the timetable problem. Communications of the ACM, 17(8), 450\u2013453.","journal-title":"Communications of the ACM"},{"issue":"3","key":"2090_CR26","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1057\/palgrave.jors.2601495","volume":"54","author":"K Papoutsis","year":"2003","unstructured":"Papoutsis, K., Valouxis, C., & Housos, E. (2003). A column generation approach for the timetabling problem of greek high schools. Journal of the Operational Research Society, 54(3), 230\u2013238.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"2090_CR27","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10479-013-1321-8","volume":"218","author":"N Pillay","year":"2014","unstructured":"Pillay, N. (2014). A survey of school timetabling research. Annals of Operations Research, 218(1), 261\u2013293.","journal-title":"Annals of Operations Research"},{"doi-asserted-by":"publisher","unstructured":"Qualizza, A., & Serafini, P. (2005). A column generation scheme for faculty timetabling. In Practice and theory of automated timetabling V (pp. 161\u2013173). Berlin: Springer.","key":"2090_CR28","DOI":"10.1007\/11593577_10"},{"issue":"4","key":"2090_CR29","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/s00291-006-0074-z","volume":"29","author":"K Schimmelpfeng","year":"2007","unstructured":"Schimmelpfeng, K., & Helber, S. (2007). Application of a real-world university-course timetabling model solved by integer programming. OR Spectrum, 29(4), 783\u2013803.","journal-title":"OR Spectrum"},{"doi-asserted-by":"publisher","unstructured":"\u00dclker, \u00d6., \u00d6zcan, E., & Korkmaz, E. E. (2007) Linear linkage encoding in grouping problems: Applications on graph coloring and timetabling. In Practice and theory of automated timetabling VI (pp. 347\u2013363). Berlin: Springer.","key":"2090_CR30","DOI":"10.1007\/978-3-540-77345-0_22"},{"issue":"3\u20134","key":"2090_CR31","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1080\/00207169508804397","volume":"56","author":"X Yao","year":"1995","unstructured":"Yao, X. (1995). A new simulated annealing algorithm. International Journal of Computer Mathematics, 56(3\u20134), 161\u2013168.","journal-title":"International Journal of Computer Mathematics"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2090-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2090-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2090-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2090-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T17:49:53Z","timestamp":1567446593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2090-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,23]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["2090"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2090-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2015,12,23]]}}}