{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T01:47:43Z","timestamp":1783648063523,"version":"3.55.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,2,19]],"date-time":"2011-02-19T00:00:00Z","timestamp":1298073600000},"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-011-0854-y","type":"journal-article","created":{"date-parts":[[2011,2,18]],"date-time":"2011-02-18T15:32:02Z","timestamp":1298043122000},"page":"89-109","source":"Crossref","is-referenced-by-count":20,"title":["Linear combinations of heuristics for examination timetabling"],"prefix":"10.1007","volume":"194","author":[{"given":"Edmund K.","family":"Burke","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nam","family":"Pham","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rong","family":"Qu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jay","family":"Yellen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2011,2,19]]},"reference":[{"issue":"2","key":"854_CR1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s00291-006-0034-7","volume":"29","author":"S. Abdullah","year":"2007","unstructured":"Abdullah, S., Ahmadi, S., Burke, E. K., & Dror, M. (2007). Investigating Ahuja-Orlin\u2019s large neighbourhood search for examination timetabling. OR Spectrum, 29(2), 351\u2013372.","journal-title":"OR Spectrum"},{"key":"854_CR2","first-page":"1","volume":"16","author":"D. Abramson","year":"1999","unstructured":"Abramson, D., Krishnamoorthy, M., & Dang, H. (1999). Simulated annealing cooling schedules for the school timetabling problem. Asia-Pacific Journal of Operational Research, 16, 1\u201322.","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"854_CR3","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/11593577_19","volume-title":"Selected papers from the 5th international conference on the practice and theory of automated timetabling","author":"H. Asmuni","year":"2005","unstructured":"Asmuni, H., Burke, E. K., Garibaldi, J., & McCollum, B. (2005). Fuzzy multiple ordering criteria for examination timetabling. In E. K. Burke & M. Trick (Eds.), Lecture notes in computer science: Vol. 3616. Selected papers from the 5th international conference on the practice and theory of automated timetabling (pp. 334\u2013353)."},{"key":"854_CR4","volume-title":"Proceedings of the 12th Canadian conference on artificial intelligence","author":"D. Banks","year":"1998","unstructured":"Banks, D., Beek, P., & Meisles, A. (1998). A heuristic incremental modelling approach to course timetabling. In Proceedings of the 12th Canadian conference on artificial intelligence."},{"key":"854_CR5","series-title":"Lecture notes in computer science","volume-title":"Practice and theory of automated timetabling I: selected papers from the 1st international conference","author":"V. A. Bardadym","year":"1996","unstructured":"Bardadym, V. A. (1996). Computer-aided school and university timetabling: the new wave. In E. K. Burke & P. Ross (Eds.), Lecture notes in computer science. Practice and theory of automated timetabling I: selected papers from the 1st international conference."},{"key":"854_CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D. (1979). New methods to color the vertices of a graph. Communications of the ACM, 22, 251\u2013256.","journal-title":"Communications of the ACM"},{"key":"854_CR7","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1145\/355586.364824","volume":"7","author":"S. Broder","year":"1964","unstructured":"Broder, S. (1964). Final examination scheduling. Communications of the ACM, 7, 494\u2013498.","journal-title":"Communications of the ACM"},{"key":"854_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/4235.752921","volume":"3","author":"E. K. Burke","year":"1999","unstructured":"Burke, E. K., & Newall, J. (1999). A multi-stage evolutionary algorithm for the timetabling problem. IEEE Transactions on Evolutionary Computation, 3, 63\u201374.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"854_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10951-006-6775-y","volume":"9","author":"E. K. Burke","year":"2006","unstructured":"Burke, E. K., Petrovic, S., & Qu, R. (2006). Case based heuristic selection for timetabling problems. Journal of Scheduling, 9, 115\u2013132.","journal-title":"Journal of Scheduling"},{"key":"854_CR10","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 hyperheuristic for timetabling and rostering. Journal of Heuristics, 9, 451\u2013470.","journal-title":"Journal of Heuristics"},{"key":"854_CR11","volume-title":"Handbook of graph theory","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., Kingston, J., & Dewerra, D. (2004). Applications to timetabling. In J. Gross & J. Yellen (Eds.), Handbook of graph theory. London\/Boca Raton: Chapman Hall\/CRC Press."},{"key":"854_CR12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2010.01.044","volume":"206","author":"E. K. Burke","year":"2010","unstructured":"Burke, E. K., Eckersley, A. J., McCollum, B., Petrovic, S., & Qu, R. (2010). Hybrid variable neighbourhood approaches to university exam timetabling. European Journal of Operational Research (EJOR), 206, 46\u201353.","journal-title":"European Journal of Operational Research"},{"key":"854_CR13","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-44691-5_20","volume-title":"Algorithm engineering 4th international workshop, proceedings WAE 2000","author":"M. Caramia","year":"2001","unstructured":"Caramia, M., Dellolmo, P., & Italiano, G. F. (2001). New algorithms for examination timetabling. In S. Naher & D. Wagner (Eds.), Lecture notes in computer science: Vol. 1982. Algorithm engineering 4th international workshop, proceedings WAE 2000 (pp. 230\u2013241)."},{"key":"854_CR14","volume-title":"Proceedings of 26th workshop of the UK planning and scheduling","author":"J. R. Carrington","year":"2007","unstructured":"Carrington, J. R., Pham, N., Qu, R., & Yellen, J. (2007). An enhanced weighted graph model for examination\/course timetabling. In Proceedings of 26th workshop of the UK planning and scheduling."},{"key":"854_CR15","first-page":"230","volume":"27","author":"M. Carter","year":"1986","unstructured":"Carter, M. (1986). A Lagrangian relaxation approach to the classroom assignment problem. INFOR, 27, 230\u2013246.","journal-title":"INFOR"},{"key":"854_CR16","series-title":"Lecture notes in computer science","volume-title":"Selected papers from the 2nd international conference on the practice and theory of automated timetabling","author":"M. Carter","year":"1998","unstructured":"Carter, M., & Laporte, G. (1998). Recent developments in practical course timetabling. In E. K. Burke & P. Ross (Eds.), Lecture notes in computer science. Selected papers from the 2nd international conference on the practice and theory of automated timetabling."},{"key":"854_CR17","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"47","author":"M. Carter","year":"1996","unstructured":"Carter, M., Laporte, G., & Lee, S. (1996). Examination timetabling: algorithmic strategies and applications. Journal of Operations Research Society, 47, 373\u2013383.","journal-title":"Journal of Operations Research Society"},{"key":"854_CR18","series-title":"Lecture notes in computer science","volume-title":"Selected papers from the 4th international conference on the practice and theory of automated timetabling","author":"S. Casey","year":"2002","unstructured":"Casey, S., & Thompson, J. (2002). GRASPing the examination scheduling problem. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science. Selected papers from the 4th international conference on the practice and theory of automated timetabling."},{"key":"854_CR19","series-title":"Lecture notes in computer science","first-page":"151","volume-title":"Practice and theory of automated timetabling: selected papers from the 5th international conference","author":"P. Cote","year":"2005","unstructured":"Cote, P., Wong, T., & Sabouri, R. (2005). Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem. In E. K. Burke & M. Trick (Eds.), Lecture notes in computer science: Vol. 3616. Practice and theory of automated timetabling: selected papers from the 5th international conference (pp. 151\u2013168)."},{"key":"854_CR20","first-page":"201","volume":"49","author":"D. Werra de","year":"1985","unstructured":"de\u00a0Werra, D. (1985). Graphs, hypergraphs and timetabling. Methods of Operations Research, 49, 201\u2013213.","journal-title":"Methods of Operations Research"},{"key":"854_CR21","series-title":"Lecture notes in computer science","volume-title":"Selected papers from the 3rd international conference on the practice and theory of automated timetabling","author":"L. Gaspero Di","year":"2000","unstructured":"Di Gaspero, L., & Schaerf, A. (2000). Tabu search techniques for examination timetabling. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science. Selected papers from the 3rd international conference on the practice and theory of automated timetabling."},{"key":"854_CR22","series-title":"Lecture notes in computer science","volume-title":"Selected papers from the 2nd international conference on the practice and theory of automated timetabling","author":"K. Dowsland","year":"1998","unstructured":"Dowsland, K. (1998). Off the peg or made to measure. In E. K. Burke & M. Carter (Eds.), Lecture notes in computer science. Selected papers from the 2nd international conference on the practice and theory of automated timetabling."},{"key":"854_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/b101874","volume-title":"Handbook of metaheuristics","author":"F. Glover","year":"2003","unstructured":"Glover, F., & Kochenberger, G. (2003). Handbook of metaheuristics. Dordrecht: Kluwer Academic."},{"key":"854_CR24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0305-0548(92)90059-E","volume":"19","author":"L. Kiaer","year":"1992","unstructured":"Kiaer, L., & Yellen, J. (1992). Weighted graphs and university timetabling. Computers and Operations Research, 19, 59\u201367.","journal-title":"Computers and Operations Research"},{"key":"854_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(82)80002-7","volume":"11","author":"J. Krarup","year":"1982","unstructured":"Krarup, J., & Dewerra, D. (1982). Chromatic optimization\u2014limitations, objectives, uses, references. European Journal of Operational Research, 11, 1\u201319.","journal-title":"European Journal of Operational Research"},{"key":"854_CR26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/inte.11.5.57","volume":"11","author":"N. K. Mehta","year":"1981","unstructured":"Mehta, N. K. (1981). The application of a graph-coloring method to an examination scheduling problem. Interfaces, 11, 57\u201365.","journal-title":"Interfaces"},{"key":"854_CR27","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-540-45157-0_14","volume-title":"Practice and theory of automated timetabling IV","author":"L. T. G. Merlot","year":"2003","unstructured":"Merlot, L. T. G., Boland, N., Hughes, B. D., & Stuckey, P. J. (2003). A hybrid algorithm for the examination timetabling problem. In Practice and theory of automated timetabling IV (Vol.\u00a02740, pp.\u00a0207\u2013231)."},{"key":"854_CR28","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1145\/361082.361092","volume":"17","author":"G. A. Neufeld","year":"1974","unstructured":"Neufeld, G. A., & Tartar, J. (1974). Graph coloring conditions for existence of solutions to timetable problem. Communications of the ACM, 17, 450\u2013453.","journal-title":"Communications of the ACM"},{"key":"854_CR29","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/S0377-2217(97)00294-4","volume":"106","author":"K. Nonobe","year":"1998","unstructured":"Nonobe, K., & Ibaraki, T. (1998). A tabu search approach to the constraint satisfaction problem as a general problem solver. European Journal of Operational Research, 106, 599\u2013623.","journal-title":"European Journal of Operational Research"},{"key":"854_CR30","volume-title":"Combinatorial optimization: algorithms and complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. New York: Prentice-Hall."},{"key":"854_CR31","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"S. Petrovic","year":"2004","unstructured":"Petrovic, S., & Burke, E. K. (2004). University timetabling. In J. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton: CRC Press."},{"key":"854_CR32","volume-title":"Proceedings of the 6th metaheuristics international conference","author":"R. Qu","year":"2005","unstructured":"Qu, R., & Burke, E. K. (2005). Hybrid variable neighborhood hyper-heuristics for exam timetabling problems. In Proceedings of the 6th metaheuristics international conference."},{"issue":"1","key":"854_CR33","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. K., McCollum, B., Merlot, L. T. G., & Lee, S. Y. (2009). A survey of search methodologies and automated approaches for examination timetabling. Journal of Scheduling, 12(1), 55\u201389.","journal-title":"Journal of Scheduling"},{"key":"854_CR34","volume-title":"Modern heuristic techniques for combinatorial problems","author":"C. R. Reeves","year":"1993","unstructured":"Reeves, C. R. (1993). Modern heuristic techniques for combinatorial problems. Oxford: Scientific Publications."},{"key":"854_CR35","volume-title":"Modern heuristic search methods","author":"C. R. Reeves","year":"1996","unstructured":"Reeves, C. R. (1996). Modern heuristic techniques. In V. J. R-Smith, I. H. Osman, C. R. Reeves, & G. D. Smith (Eds.), Modern heuristic search methods."},{"key":"854_CR36","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13, 87\u2013127.","journal-title":"Artificial Intelligence Review"},{"key":"854_CR37","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/comjnl\/23.4.307","volume":"23","author":"G. Schmidt","year":"1980","unstructured":"Schmidt, G., & Strohlein, T. (1980). Timetable-construction\u2014an annotated-bibliography. Computer Journal, 23, 307\u2013316.","journal-title":"Computer Journal"},{"key":"854_CR38","series-title":"Lecture notes in computer science","volume-title":"Proceedings of the 3rd international workshop on ant algorithms","author":"K. Socha","year":"2002","unstructured":"Socha, K., Knowles, J., & Sampels, M. (2002). A max-min ant system for the university course timetabling problem. In Lecture notes in computer science: Vol. 2463. Proceedings of the 3rd international workshop on ant algorithms."},{"key":"854_CR39","first-page":"635","volume-title":"Genetic algorithms and classifier systems","author":"H. Terashima-Mar\u00edn","year":"1999","unstructured":"Terashima-Mar\u00edn, H., Ross, P., & Valenzuela-Rend\u00f3n, M. (1999). Evolution of constraint satisfaction strategies in examination timetabling. In Genetic algorithms and classifier systems (pp. 635\u2013642)."},{"key":"854_CR40","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D. J. A. Welsh","year":"1967","unstructured":"Welsh, D. J. A., & Powell, M. B. (1967). An upper bound for chromatic number of a graph and its application to timetabling problems. Computer Journal 10, 85\u201386.","journal-title":"Computer Journal"},{"key":"854_CR41","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1093\/comjnl\/11.1.41","volume":"11","author":"D. C. Wood","year":"1968","unstructured":"Wood, D. C. (1968). A system for computing university examination timetables. The Computer Journal, 11, 41\u201347.","journal-title":"The Computer Journal"},{"key":"854_CR42","series-title":"Lecture notes in computer science","first-page":"377","volume-title":"Practice and theory of automated timetabling: selected papers from the 5th international conference","author":"Y. Yang","year":"2005","unstructured":"Yang, Y., & Petrovic, S. (2005). A Novel similarity measure for heuristic selection in examination timetabling. In E. K. Burke & M. Trick (Eds.), Lecture notes in computer science: Vol. 3616. Practice and theory of automated timetabling: selected papers from the 5th international conference (pp. 377\u2013396)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0854-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0854-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0854-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:08:05Z","timestamp":1559153285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0854-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,19]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["854"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0854-y","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,19]]}}}