{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T16:02:21Z","timestamp":1783526541421,"version":"3.55.0"},"reference-count":164,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,10,29]],"date-time":"2008-10-29T00:00:00Z","timestamp":1225238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10951-008-0077-5","type":"journal-article","created":{"date-parts":[[2008,10,28]],"date-time":"2008-10-28T19:22:35Z","timestamp":1225221755000},"page":"55-89","source":"Crossref","is-referenced-by-count":275,"title":["A survey of search methodologies and automated system development for examination timetabling"],"prefix":"10.1007","volume":"12","author":[{"given":"R.","family":"Qu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"E. K.","family":"Burke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"McCollum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L. T. G.","family":"Merlot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. Y.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,10,29]]},"reference":[{"key":"77_CR1","volume-title":"Simulated annealing and Boltzmann machines","author":"E. H. L. Aarts","year":"1989","unstructured":"Aarts, E. H. L., & Korst, J. (1989). Simulated annealing and Boltzmann machines. New York: Wiley."},{"key":"77_CR2","isbn-type":"print","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/0-387-28356-0_7","volume-title":"Search methodologies: introductory tutorials in optimisation and decision support techniques","author":"E. H. L. Aarts","year":"2005","unstructured":"Aarts, E. H. L., Korst, J., & Michiels, W. (2005). Simulated annealing. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimisation and decision support techniques (pp.\u00a0187\u2013211). Berlin: Springer. ISBN: 0387234608.","ISBN":"https:\/\/id.crossref.org\/isbn\/0387234608"},{"issue":"2","key":"77_CR3","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. (2007a). Investigating Ahuja\u2013Orlins large neighbourhood search for examination timetabling. OR Spectrum, 29(2), 351\u2013372.","journal-title":"OR Spectrum"},{"key":"77_CR4","doi-asserted-by":"crossref","first-page":"1494","DOI":"10.1057\/palgrave.jors.2602258","volume":"58","author":"S. Abdullah","year":"2007","unstructured":"Abdullah, S., Ahmadi, S., Burke, E. K., Dror, M., & McCollum, B. (2007b). A tabu based large neighbourhood search methodology for the capacitated examination timetabling problem. Journal of Operational Research, 58, 1494\u20131502.","journal-title":"Journal of Operational Research"},{"key":"77_CR5","unstructured":"Ahmadi, S., Barone, R., Cheng, P., Cowling, P., & McCollum, B. (2003). Perturbation based variable neighbourhood search in heuristic space for examination timetabling problem. In Proceedings of multidisciplinary international scheduling: theory and applications (MISTA 2003) (pp.\u00a0155\u2013171), Nottingham, 13\u201316 August, 2003. ISBN: 0-9545821-2-8."},{"key":"77_CR6","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"R. K. Ahuja","year":"2001","unstructured":"Ahuja, R. K., Orlin, J. B., & Sharma, D. (2001). Multi-exchange neighbourhood search algorithm for capacitated minimum spanning tree problem. Mathematical Programming, 91, 71\u201397.","journal-title":"Mathematical Programming"},{"key":"77_CR7","first-page":"169","volume-title":"Constraint and integer programming: toward a unified methodology","author":"F. Ajili","year":"2003","unstructured":"Ajili, F., & Wallace, M. W. (2003). Hybrid problem solving in ECLiPSe. In M. Milano (Ed.), Constraint and integer programming: toward a unified methodology (pp.\u00a0169\u2013201). Dordrecht: Kluwer Academic."},{"key":"77_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/11593577_19","volume-title":"Practice and theory of automated timetabling V: selected papers from the 5th international conference","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.\u00a03616. Practice and theory of automated timetabling V: selected papers from the 5th international conference (pp.\u00a0334\u2013353). Berlin: Springer."},{"key":"77_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-3-540-77345-0_21","volume-title":"Practice and theory of automated timetabling VI: selected papers from the 6th international conference","author":"H. Asmuni","year":"2007","unstructured":"Asmuni, H., Burke, E. K., Garibaldi, J., & McCollum, B. (2007a). A novel fuzzy approach to evaluate the quality of examination timetabling. In E. K. Burke & H. Rudova (Eds.), Lecture notes in computer science : Vol.\u00a03867. Practice and theory of automated timetabling VI: selected papers from the 6th international conference (pp.\u00a0327\u2013346). Berlin: Springer."},{"key":"77_CR10","unstructured":"Asmuni, H., Burke, E. K., Garibaldi, J., & McCollum, B. (2007b). Determining rules in fuzzy multiple heuristic orderings for construction examination timetables. In Proceedings of the 3rd multidisciplinary international conference on scheduling: theory and application (pp.\u00a059\u201366), Paris, France, August 2007."},{"key":"77_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-61794-9_50","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 : Vol.\u00a01153. Practice and theory of automated timetabling I: selected papers from the 1st international conference (pp.\u00a022\u201345). Berlin: Springer."},{"key":"77_CR12","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: selected papers from the 6th international conference","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. Rudova (Eds.), Lecture notes in computer science : Vol.\u00a03867. Practice and theory of automated timetabling VI: selected papers from the 6th international conference (pp.\u00a0394\u2013412). Berlin: Springer."},{"issue":"2","key":"77_CR13","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(95)00100-X","volume":"26","author":"P. Boizumault","year":"1996","unstructured":"Boizumault, P., Delon, Y., & Peridy, L. (1996). Constraint logic programming for examination timetabling. Journal of Logic Programming, 26(2), 217\u2013233.","journal-title":"Journal of Logic Programming"},{"key":"77_CR14","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/S0377-2217(98)00364-6","volume":"119","author":"S. C. Brailsford","year":"1999","unstructured":"Brailsford, S. C., Potts, C. N., & Smith, B. M. (1999). Constraint satisfaction problems: Algorithms and applications. European Journal of Operational Research, 119, 557\u2013581.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"77_CR15","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 colour the vertices of a graph. Communication of the ACM, 22(4), 251\u2013256.","journal-title":"Communication of the ACM"},{"key":"77_CR16","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":"77_CR17","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0055882","volume-title":"Practice and theory of automated timetabling II: selected papers from the 2nd international conference","author":"B. Bullnheimer","year":"1998","unstructured":"Bullnheimer, B. (1998). An examination scheduling model to maximise students study time. In E. K. Burke & M. W. Carter (Eds.), Lecture notes in computer science : Vol.\u00a01408. Practice and theory of automated timetabling II: selected papers from the 2nd international conference (pp.\u00a078\u201391). Berlin: Springer."},{"key":"77_CR18","series-title":"Lecture notes in computer science","isbn-type":"print","volume-title":"Practice and theory of automated timetabling II: selected papers from the 2nd international conference","year":"1998","unstructured":"Burke, E. K., & Carter, M. W. (Eds.). (1998). Lecture notes in computer science : Vol.\u00a01408. Practice and theory of automated timetabling II: selected papers from the 2nd international conference. Berlin: Springer. ISBN: 3-540-64979-4.","ISBN":"https:\/\/id.crossref.org\/isbn\/3540649794"},{"key":"77_CR19","series-title":"Lecture notes in computer science","isbn-type":"print","volume-title":"Practice and theory of automated timetabling IV: selected papers from the 4th international conference","year":"2003","unstructured":"Burke, E. K., & De Causmaecker, P. (Eds.). (2003). Lecture notes in computer science : Vol.\u00a02740. Practice and theory of automated timetabling IV: selected papers from the 4th international conference. Berlin: Springer. ISBN: 3-540-40699-9.","ISBN":"https:\/\/id.crossref.org\/isbn\/3540406999"},{"key":"77_CR20","series-title":"Lecture notes in computer science","isbn-type":"print","volume-title":"Practice and theory of automated timetabling III: selected papers from the 3rd international conference","year":"2001","unstructured":"Burke, E. K., & Erben, W. (Eds.). (2001). Lecture notes in computer science : Vol.\u00a02079. Practice and theory of automated timetabling III: selected papers from the 3rd international conference. Berlin: Springer. ISBN: 3-540-42421-0.","ISBN":"https:\/\/id.crossref.org\/isbn\/3540424210"},{"key":"77_CR21","isbn-type":"print","volume-title":"Search methodologies: introductory tutorials in optimisation and decision support techniques","year":"2005","unstructured":"Burke, E. K., & Kendall, G. (Eds.). (2005). Search methodologies: introductory tutorials in optimisation and decision support techniques. Berlin: Springer. ISBN: 0387234608.","ISBN":"https:\/\/id.crossref.org\/isbn\/0387234608"},{"key":"77_CR22","series-title":"Studies in fuzziness and soft computing","first-page":"289","volume-title":"Recent advances in memetic algorithms and related search technologies","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., & Landa Silva, J. D. (2004). The design of memetic algorithms for scheduling and timetabling problems. In W. E. Hart, N. Krasnogor, & J. E. Smith (Eds.), Studies in fuzziness and soft computing : Vol.\u00a0166. Recent advances in memetic algorithms and related search technologies (pp.\u00a0289\u2013312). Berlin: Springer."},{"issue":"1","key":"77_CR23","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. P. (1999). A multi-stage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation, 3(1), 63\u201374.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"77_CR24","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/978-3-540-45157-0_13","volume-title":"Practice and theory of automated timetabling IV: selected papers from the 4th international conference","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., & Newall, J. P. (2003). Enhancing timetable solutions with local search methods. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science : Vol.\u00a02740. Practice and theory of automated timetabling IV: selected papers from the 4th international conference (pp.\u00a0195\u2013206). Berlin: Springer."},{"key":"77_CR25","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/B:ANOR.0000030684.30824.08","volume":"129","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., & Newall, J. P. (2004). Solving examination timetabling problems through adaptation of heuristic orderings. Annals of Operational Research, 129, 107\u2013134.","journal-title":"Annals of Operational Research"},{"issue":"2","key":"77_CR26","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E. K. 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"},{"key":"77_CR27","series-title":"Lecture notes in computer science","isbn-type":"print","volume-title":"Practice and theory of automated timetabling I: selected papers from the 1st international conference","year":"1996","unstructured":"Burke, E. K., & Ross, P. (Eds.). (1996). Lecture notes in computer science : Vol.\u00a01153. Practice and theory of automated timetabling I: selected papers from the 1st international conference. Berlin: Springer. ISBN: 3-540-61794-9.","ISBN":"https:\/\/id.crossref.org\/isbn\/3540617949"},{"key":"77_CR28","series-title":"Lecture notes in computer science","isbn-type":"print","volume-title":"Practice and theory of automated timetabling VI: selected papers from the 6th international conference","year":"2007","unstructured":"Burke, E. K., & Rudova, H. (Eds.). (2007). Lecture notes in computer science : Vol.\u00a03867. Practice and theory of automated timetabling VI: selected papers from the 6th international conference. Berlin: Springer. ISBN: 978-3-540-77344-3.","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540773"},{"key":"77_CR29","series-title":"Lecture notes in computer science","isbn-type":"print","volume-title":"Practice and theory of automated timetabling V: selected papers from the 5th international conference","year":"2005","unstructured":"Burke, E. K., & Trick, M. (Eds.). (2005). Lecture notes in computer science : Vol.\u00a03616. Practice and theory of automated timetabling V: selected papers from the 5th international conference. Berlin: Springer. ISBN: 3-540-30705-2.","ISBN":"https:\/\/id.crossref.org\/isbn\/3540307052"},{"key":"77_CR30","unstructured":"Burke, E. K., Elliman, D. G., & Weare, R. F. (1994). A genetic algorithm for university timetabling. In Proceedings of the AISB workshop on evolutionary computing, University of Leeds, UK, 11\u201313 April 1994."},{"key":"77_CR31","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-61794-9_52","volume-title":"Practice and theory of automated timetabling I: selected papers from the 1st international conference","author":"E. K. Burke","year":"1996","unstructured":"Burke, E. K., Elliman, D. G., Ford, P. H., & Weare, R. F. (1996a). Examination timetabling in British universities: a survey. In E.\u00a0K. Burke & P. Ross (Eds.), Lecture notes in computer science : Vol.\u00a01153. Practice and theory of automated timetabling I: selected papers from the 1st international conference (pp.\u00a076\u201390). Berlin: Springer."},{"key":"77_CR32","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-61794-9_63","volume-title":"Practice and theory of automated timetabling I: selected papers from the 1st international conference","author":"E. K. Burke","year":"1996","unstructured":"Burke, E. K., Newall, J. P., & Weare, R. F. (1996b). A memetic algorithm for university exam timetabling. In E. K. Burke & P. Ross (Eds.), Lecture notes in computer science : Vol.\u00a01153. Practice and theory of automated timetabling I: selected papers from the 1st international conference (pp.\u00a0241\u2013250). Berlin: Springer."},{"issue":"9","key":"77_CR33","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1093\/comjnl\/40.9.565","volume":"40","author":"E. K. Burke","year":"1997","unstructured":"Burke, E. K., Jackson, K., Kingston, J. H., & Weare, R. (1997). Automated university timetabling: the state of the art. The Computer Journal, 40(9), 565\u2013571.","journal-title":"The Computer Journal"},{"key":"77_CR34","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BFb0055877","volume-title":"Practice and theory of automated timetabling II: selected papers from the 2nd international conference","author":"E. K. Burke","year":"1998","unstructured":"Burke, E. K., Kingston, J., & Pepper, P. A. (1998a). A standard data format for timetabling instances. In E. K. Burke & M. W. Carter (Eds.), Lecture notes in computer science : Vol.\u00a01408. Practice and theory of automated timetabling II: selected papers from the 2nd international conference (pp.\u00a0215\u2013224). Berlin: Springer."},{"issue":"1","key":"77_CR35","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1162\/evco.1998.6.1.81","volume":"6","author":"E. K. Burke","year":"1998","unstructured":"Burke, E. K., Newall, J. P., & Weare, R. F. (1998b). Initialisation strategies and diversity in evolutionary timetabling. Evolutionary Computation, 6(1), 81\u2013103.","journal-title":"Evolutionary Computation"},{"key":"77_CR36","unstructured":"Burke, E. K., Newall, J. P., & Weare, R. F. (1998c). A simple heuristically guided search for the timetable problem. In Proceedings of the international ICSC symposium on engineering of intelligent systems (EIS98) (pp.\u00a0574\u2013579)."},{"issue":"2\u20133","key":"77_CR37","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0950-7051(00)00057-5","volume":"13","author":"E. K. Burke","year":"2000","unstructured":"Burke, E. K., MacCarthy, B., Petrovic, S., & Qu, R. (2000). Structured cases in CBR\u2014Re-using and adapting cases for timetabling problems. Knowledge-Based Systems, 13(2\u20133), 159\u2013165.","journal-title":"Knowledge-Based Systems"},{"key":"77_CR38","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-44629-X_8","volume-title":"Practice and theory of automated timetabling III: selected papers from the 3rd international conference","author":"E. K. Burke","year":"2001","unstructured":"Burke, E. K., Bykov, Y., & Petrovic, S. (2001). A multi-criteria approach to examination timetabling. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol.\u00a02079. Practice and theory of automated timetabling III: selected papers from the 3rd international conference (pp.\u00a0118\u2013131). Berlin: Springer."},{"key":"77_CR39","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of meta-heuristics","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., Hart, E., Kendall, G., Newall, J., Ross, P., & Schulenburg, S. (2003a). Hyper-heuristics: an emerging direction in modern search technology. In F. Glover & G. Kochenberger (Eds.), Handbook of meta-heuristics (pp.\u00a0457\u2013474). Dordrecht: Kluwer."},{"key":"77_CR40","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. (2003b). A tabu-search hyper-heuristic for timetabling and rostering. Journal of Heuristics, 9, 451\u2013470.","journal-title":"Journal of Heuristics"},{"issue":"6","key":"77_CR41","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1080\/07408170490438410","volume":"36","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., Bykov, Y., Newall, J. P., & Petrovic, S. (2004a). A time-predefined local search approach to exam timetabling problems. IIE Transactions, 36(6), 509\u2013528.","journal-title":"IIE Transactions"},{"issue":"6","key":"77_CR42","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. (2004b). The state of the art of nurse rostering. Journal of Scheduling, 7(6), 441\u2013499.","journal-title":"Journal of Scheduling"},{"key":"77_CR43","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Eckersley, A. J., McCollum, B., Petrovic, S., & Qu, R. (2004c). Analysing similarity in examination timetabling. In: E.\u00a0K. Burke, M. Trick (Eds.), Proceedings of the 5th international conference on the practice and theory of automated timetabling (pp.\u00a089\u2013106), Pittsburgh, PA, USA, August 2004.","DOI":"10.1007\/11593577"},{"key":"77_CR44","first-page":"445","volume-title":"The handbook of graph theory","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., Kingston, J. H., & de Werra, D. (2004d). Applications to timetabling. In J. Gross & J. Yellen (Eds.), The handbook of graph theory (pp.\u00a0445\u2013474). London: Chapman Hall\/CRC."},{"key":"77_CR45","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/0-387-23529-9_6","volume-title":"The next wave in computing, optimisation, and decision technologies","author":"E. K. Burke","year":"2005","unstructured":"Burke, E. K., Dror, M., Petrovic, S., & Qu, R. (2005). Hybrid graph heuristics in hyper-heuristics applied to exam timetabling problems. In B.\u00a0L. Golden, S.\u00a0Raghavan, & E. A. Wasil (Eds.), The next wave in computing, optimisation, and decision technologies (pp.\u00a079\u201391). Maryland: Springer."},{"key":"77_CR46","unstructured":"Burke, E. K., Eckersley, A. J., McCollum, B., Petrovic, S., & Qu, R. (2006a). Hybrid variable neighbourhood approaches to university exam timetabling (Technical Report NOTTCS-TR-2006-2). School of Computer Science, University of Nottingham."},{"key":"77_CR47","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. (2006b). Case-based heuristic selection for timetabling problems. Journal of Scheduling, 9, 115\u2013132.","journal-title":"Journal of Scheduling"},{"key":"77_CR48","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E. K. Burke","year":"2007","unstructured":"Burke, E. K., McCollum, B., Meisels, A., Petrovic, S., & Qu, R. (2007). A graph based hyper-heuristic for exam timetabling problems. European Journal of Operational Research, 176, 177\u2013192.","journal-title":"European Journal of Operational Research"},{"key":"77_CR49","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., Dell\u2019Olmo, P., & Italiano, G. F. (2001). New algorithms for examination timetabling. In S. Naher & D. Wagner (Eds.), Lecture notes in computer science : Vol.\u00a01982. Algorithm engineering 4th international workshop, proceedings WAE 2000 (pp.\u00a0230\u2013241). Berlin: Springer."},{"issue":"1","key":"77_CR50","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/ijoc.1070.0220","volume":"20","author":"M. Caramia","year":"2008","unstructured":"Caramia, M., Dell\u2019Olmo, P., & Italiano, G. F. (2008). Novel local-search-based approaches to university examination timetabling. INFORMS Journal of Computing, 20(1), 86\u201399.","journal-title":"INFORMS Journal of Computing"},{"key":"77_CR51","unstructured":"Carter, M. W. (1983). A decomposition algorithm for practical timetabling problems (Technical Paper 83-06). Department of Industrial Engineering, University of Toronto."},{"issue":"2","key":"77_CR52","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"M. W. Carter","year":"1986","unstructured":"Carter, M. W. (1986). A survey of practical applications of examination timetabling algorithms. Operations Research, 34(2), 193\u2013202.","journal-title":"Operations Research"},{"key":"77_CR53","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1057\/palgrave.jors.2601115","volume":"52","author":"M. W. Carter","year":"2001","unstructured":"Carter, M. W., & Johnson, D. G. (2001). Extended clique initialisation in examination timetabling. Journal of Operational Research Society, 52, 538\u2013544.","journal-title":"Journal of Operational Research Society"},{"key":"77_CR54","series-title":"Lecture notes in computer science","first-page":"3","volume-title":"Practice and theory of automated timetabling I: selected papers from the 1st international conference","author":"M. W. Carter","year":"1996","unstructured":"Carter, M. W., & Laporte, G. (1996). Recent developments in practical examination timetabling. In E. K. Burke & P. Ross (Eds.), Lecture notes in computer science : Vol.\u00a01153. Practice and theory of automated timetabling I: selected papers from the 1st international conference (pp.\u00a03\u201321). Berlin: Springer."},{"key":"77_CR55","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1287\/inte.24.3.109","volume":"24","author":"M. W. Carter","year":"1994","unstructured":"Carter, M. W., Laporte, G., & Chinneck, J. W. (1994). A general examination scheduling system. Interfaces, 24, 109\u2013120.","journal-title":"Interfaces"},{"issue":"3","key":"77_CR56","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"47","author":"M. W. Carter","year":"1996","unstructured":"Carter, M. W., Laporte, G., & Lee, S. Y. (1996). Examination timetabling: algorithmic strategies and applications. Journal of Operational Research Society, 47(3), 373\u2013383.","journal-title":"Journal of Operational Research Society"},{"key":"77_CR57","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/978-3-540-45157-0_15","volume-title":"Practice and theory of automated timetabling IV: selected papers from the 4th international conference","author":"S. Casey","year":"2003","unstructured":"Casey, S., & Thompson, J. (2003). GRASPing the examination scheduling problem. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science : Vol.\u00a02740. Practice and theory of automated timetabling IV: selected papers from the 4th international conference (pp.\u00a0232\u2013244). Berlin: Springer."},{"key":"77_CR58","series-title":"Lecture notes in computer science","first-page":"125","volume-title":"Proceedings of the 5th international conference on the practice and theory of automated timetabling","author":"A. Chand","year":"2005","unstructured":"Chand, A. (2005). A constraint based genetic model for representing complete University timetabling data. In E. K. Burke & M. Trick (Eds.), Lecture notes in computer science : Vol.\u00a03616. Proceedings of the 5th international conference on the practice and theory of automated timetabling (pp.\u00a0125\u2013150). Berlin: Springer."},{"key":"77_CR59","first-page":"297","volume-title":"Proceedings of the 1st international conference on the practice and theory of automated timetabling","author":"A. W. Colijn","year":"1995","unstructured":"Colijn, A. W., & Layfield, C. (1995a). Conflict reduction in examination schedules. In E. K. Burke & P. Ross (Eds.), Proceedings of the 1st international conference on the practice and theory of automated timetabling. (pp.\u00a0297\u2013307), 30 August\u20131 September 1995. Edinburgh: Napier University."},{"key":"77_CR60","first-page":"112","volume-title":"Proceedings of the 1st international conference on the practice and theory of automated timetabling","author":"A. W. Colijn","year":"1995","unstructured":"Colijn, A. W., & Layfield, C. (1995b). Interactive improvement of examination schedules. In E. K. Burke & P. Ross (Eds.), Proceedings of the 1st international conference on the practice and theory of automated timetabling (pp.\u00a0112\u2013121), 30 August\u20131 September 1995. Edinburgh: Napier University."},{"key":"77_CR61","series-title":"Lecture notes in computer science","first-page":"283","volume-title":"Practice and theory of automated timetabling I: selected papers from the 1st international conference","author":"T. B. Cooper","year":"1996","unstructured":"Cooper, T. B., & Kingston, J. H. (1996). The complexity of timetable construction problems. In E. K. Burke (Ed.), Lecture notes in computer science : Vol.\u00a01153. Practice and theory of automated timetabling I: selected papers from the 1st international conference (pp.\u00a0283\u2013295). Berlin: Springer."},{"key":"77_CR62","unstructured":"Corne, D., Ross, P., & Fang, H. (1994). Evolutionary timetabling: Practice, prospects and work in progress. In P. Prosser (Ed.), Proceedings of UK planning and scheduling SIG workshop."},{"key":"77_CR63","doi-asserted-by":"crossref","unstructured":"Corr, P. H., McCollum, B., McGreevy, M. A. J., & McMullan, P. (2006). A new neural network based construction heuristic for the examination timetabling problem. In The international conference on parallel problem solving from nature (PPSN 2006) (pp.\u00a0392\u2013401), Reykjavik, Iceland, September 2006.","DOI":"10.1007\/11844297_40"},{"key":"77_CR64","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"Costa, D., & Hertz, A. (1997). Ant can colour graphs. Journal of Operational Research Society, 48, 295\u2013305.","journal-title":"Journal of Operational Research Society"},{"key":"77_CR65","series-title":"Lecture notes in computer science","first-page":"151","volume-title":"Practice and theory of automated timetabling V: selected papers from the 5th international conference","author":"P. C\u00f4t\u00e9","year":"2005","unstructured":"C\u00f4t\u00e9, 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.\u00a03616. Practice and theory of automated timetabling V: selected papers from the 5th international conference (pp.\u00a0151\u2013168). Berlin: Springer."},{"key":"77_CR66","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BFb0055888","volume-title":"Practice and theory of automated timetabling II: selected papers from the 2nd international conference","author":"P. David","year":"1998","unstructured":"David, P. (1998). A constraint-based approach for examination timetabling using local repair techniques. In E. K. Burke & M. W. Carter (Eds.), Lecture notes in computer science : Vol.\u00a01408. Practice and theory of automated timetabling II: selected papers from the 2nd international conference (pp.\u00a0169\u2013186). Berlin: Springer."},{"key":"77_CR67","unstructured":"De Causmaecker, P., Lu, Y., Demeester, P., & Vanden Berghe, G. (2002). Using web standards for timetabling. In E.\u00a0K. Burke & P.\u00a0De Causmaecker (Eds.), Proceedings of the 4th international conference on practice and theory of automated timetabling (pp. 238\u2013257), KaHo St.-Lieven, Gent, Belgium, 21\u201323 August 2002."},{"key":"77_CR68","doi-asserted-by":"crossref","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, 151\u2013162.","journal-title":"European Journal of Operational Research"},{"key":"77_CR69","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0012-365X(96)00208-7","volume":"165\/166","author":"D. Werra de","year":"1997","unstructured":"de Werra, D. (1997). Restricted colouring models for timetabling. Discrete Mathematics, 165\/166, 161\u2013170.","journal-title":"Discrete Mathematics"},{"key":"77_CR70","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/jos.97","volume":"5","author":"D. Werra de","year":"2002","unstructured":"de Werra, D., Asratian, A. S., & Durand, S. (2002). Complexity of some special types of timetabling problems. Journal of Scheduling, 5, 171\u2013183.","journal-title":"Journal of Scheduling"},{"key":"77_CR71","unstructured":"Di Gaspero, L. (2002). Recolour, shake and kick: A recipe for the examination timetabling problem. In: E.\u00a0K. Burke & P.\u00a0De Causmaecker (Eds.), Proceedings of the 4th international conference on practice and theory of automated timetabling (pp.\u00a0404\u2013407), KaHo St.-Lieven, Gent, Belgium, 21\u201323 August 2002."},{"key":"77_CR72","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-44629-X_7","volume-title":"Practice and theory of automated timetabling III: selected papers from the 3rd international conference","author":"L. Di Gaspero","year":"2001","unstructured":"Di Gaspero, L., & Schaerf, A. (2001). Tabu search techniques for examination timetabling. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol.\u00a02079. Practice and theory of automated timetabling III: selected papers from the 3rd international conference (pp.\u00a0104\u2013117). Berlin: Springer."},{"issue":"8","key":"77_CR73","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"L. Di Gaspero","year":"2003","unstructured":"Di Gaspero, L., & Schaerf, A. (2003). EasyLocal++: an object-oriented framework for flexible design of local search algorithms. Software, Practice & Experience, 33(8), 733\u2013765.","journal-title":"Software, Practice & Experience"},{"key":"77_CR74","doi-asserted-by":"crossref","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, 202\u2013213.","journal-title":"European Journal of Operational Research"},{"issue":"2\u20133","key":"77_CR75","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.tcs.2005.05.020","volume":"344","author":"M. Dorigo","year":"2005","unstructured":"Dorigo, M., & Blum, C. (2005). Ant colony optimisation theory: a survey. Theoretical Computer Science, 344(2\u20133), 243\u2013278.","journal-title":"Theoretical Computer Science"},{"key":"77_CR76","first-page":"155","volume-title":"Modern heuristic search methods","author":"K. A. Dowsland","year":"1996","unstructured":"Dowsland, K. A. (1996). Simulated annealing solutions for multi-objective scheduling and timetabling. In V. J. R. Smith, I. H. Osman, C. R. Reeves, & G. D. Smith (Eds.), Modern heuristic search methods (pp.\u00a0155\u2013166). New York: Wiley."},{"key":"77_CR77","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1057\/palgrave.jors.2601830","volume":"56","author":"K. A. Dowsland","year":"2005","unstructured":"Dowsland, K. A., & Thompson, J. (2005). Ant colony optimisation for the examination scheduling problem. Journal of Operational Research Society, 56, 426\u2013438.","journal-title":"Journal of Operational Research Society"},{"key":"77_CR78","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G. Dueck","year":"1993","unstructured":"Dueck, G. (1993). New optimization heuristics: the great deluge and the record-to-record travel. Journal of Computational Physics, 104, 86\u201392.","journal-title":"Journal of Computational Physics"},{"key":"77_CR79","unstructured":"Duong, T. A., & Lam, K. H. (2004). Combining constraint programming and simulated annealing on university exam timetabling. In Proceedings of the 2nd international conference in computer sciences, research, innovation & vision for the future (RIVF2004) (pp.\u00a0205\u2013210), Hanoi, Vietnam, 2\u20135 February, 2004."},{"key":"77_CR80","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"K. Easton","year":"2004","unstructured":"Easton, K., Nemhauser, G., & Trick, M. (2004). Sports scheduling. In J. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton: CRC Press, Chap. 52."},{"key":"77_CR81","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/978-3-540-77345-0_23","volume-title":"Practice and theory of automated timetabling VI: selected papers from the 6th international conference","author":"M. Eley","year":"2007","unstructured":"Eley, M. (2007). Ant algorithms for the exam timetabling problem. In E. K. Burke & H. Rudova (Eds.), Lecture notes in computer science : Vol.\u00a03867. Practice and theory of automated timetabling VI: selected papers from the 6th international conference (pp.\u00a0364\u2013382). Berlin: Springer."},{"key":"77_CR82","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/3-540-44629-X_9","volume-title":"Practice and theory of automated timetabling III: selected papers from the 3rd international conference","author":"W. Erben","year":"2001","unstructured":"Erben, W. (2001). A grouping genetic algorithm for graph colouring and exam timetabling. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol.\u00a02079. Practice and theory of automated timetabling III: selected papers from the 3rd international conference (pp.\u00a0132\u2013156). Berlin: Springer."},{"key":"77_CR83","unstructured":"Ersoy, E., \u00d6zcan, E., & Etaner, A. S. (2007). Memetic algorithms and hyperhill-climbers. In Proceedings of the 3rd multidisciplinary international conference on scheduling: theory and applications (pp.\u00a0159\u2013166), Paris, France, August 2007."},{"key":"77_CR84","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-28356-0_9","volume-title":"Search methodologies: introductory tutorials in optimisation and decision support techniques","author":"E. C. Freuder","year":"2005","unstructured":"Freuder, E. C., & Wallace, M. (2005). Constraint programming. In E.\u00a0K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimisation and decision support techniques (pp.\u00a0239\u2013272). Berlin: Springer."},{"key":"77_CR85","isbn-type":"print","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/0-387-28356-0_6","volume-title":"Search methodologies: introductory tutorials in optimisation and decision support techniques","author":"M. Gendreau","year":"2005","unstructured":"Gendreau, M., & Potvin, J. Y. (2005). Tabu search. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimisation and decision support techniques (pp.\u00a0165\u2013186). Berlin: Springer. ISBN: 0387234608.","ISBN":"https:\/\/id.crossref.org\/isbn\/0387234608"},{"key":"77_CR86","volume-title":"Handbook of meta-heuristics","author":"F. Glover","year":"2003","unstructured":"Glover, F., & Kochenberger, G. A. (2003). Handbook of meta-heuristics. Dordrecht: Kluwer."},{"key":"77_CR87","volume-title":"Modern heuristic techniques for combinatorial problems","author":"F. Glover","year":"1993","unstructured":"Glover, F., & Laguna, M. (1993). Tabu search. In C. R. Reeves (Ed.), Modern heuristic techniques for combinatorial problems. Oxford: Scientific Publications."},{"key":"77_CR88","series-title":"Lecture notes in computer science","first-page":"320","volume-title":"Practical aspects of declarative languages","author":"H. J. Goltz","year":"1999","unstructured":"Goltz, H. J., & Matzke, D. (1999). University timetabling using constraint logic programming. In Lecture notes in computer science : Vol.\u00a01551. Practical aspects of declarative languages (pp.\u00a0320\u2013334). Berlin: Springer."},{"key":"77_CR89","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., & Mladenovi\u0107, N. (2001). Variable neighbourhood search: principles and applications. European Journal of Operational Research, 130, 449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"77_CR90","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/0377-2217(95)00227-8","volume":"87","author":"M. P. Hansen","year":"1995","unstructured":"Hansen, M. P., & Vidal, R. V. V. (1995). Planning of high school examinations in Denmark. European Journal of Operational Research, 87, 519\u2013534.","journal-title":"European Journal of Operational Research"},{"key":"77_CR91","first-page":"468","volume-title":"Proceedings of the 1st international conference on the practice and theory of automated timetabling","author":"M. P. Hansen","year":"1995","unstructured":"Hansen, M. P., Lauersen, V., & Vidal, R. V. V. (1995). Nationwide scheduling of examinations: lessons from experience. In E. K. Burke & P. Ross (Eds.), Proceedings of the 1st international conference on the practice and theory of automated timetabling (pp.\u00a0468\u2013473), 30 August\u20131 September 1995. Edinburgh: Napier University."},{"key":"77_CR92","unstructured":"Ho, W. K., Lim, A., & Oon, W. C. (2001). Maximising paper spread in examination timetabling using a vehicle routing method. In Proceedings of 13th IEEE international conference on tools with artificial intelligence (ICTAI01) (pp.\u00a0359\u2013366)."},{"key":"77_CR93","unstructured":"Hussin, N. (2005). Tabu search based hyper-heuristic approaches for examination timetabling. PhD thesis, Department of Computer Science, University of Nottingham, UK, November 2005."},{"key":"77_CR94","series-title":"Lecture notes in computer science","first-page":"199","volume-title":"Practice and theory of automated timetabling V: selected papers from the 5th international conference","author":"G. Kendall","year":"2005","unstructured":"Kendall, G., & Hussin, N. M. (2005a). A tabu search hyper-heuristic approach to the examination timetabling problem at the MARA university of technology. In E. K.\u00a0Burke & M.\u00a0Trick (Eds.), Lecture notes in computer science : Vol.\u00a03616. Practice and theory of automated timetabling V: selected papers from the 5th international conference (pp.\u00a0199\u2013218). Berlin: Springer."},{"key":"77_CR95","doi-asserted-by":"crossref","unstructured":"Kendall, G., & Hussin, N. M. (2005b). An investigation of a tabu search based hyper-heuristic for examination timetabling. In G.\u00a0Kendall, E.\u00a0Burke, & S. Petrovic (Eds.), Selected papers from multidisciplinary scheduling; theory and applications (pp.\u00a0309\u2013328).","DOI":"10.1007\/0-387-27744-7_15"},{"key":"77_CR96","unstructured":"Kingston, J. H. (1995). Bibliography on practice and theory of automated timetabling. http:\/\/liinwww.ira.uka.de\/bibliography\/Misc\/timetabling.html ."},{"key":"77_CR97","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 III: selected papers from the 3rd international conference","author":"J. H. Kingston","year":"2001","unstructured":"Kingston, J. H. (2001). Modelling timetabling problems with STTL. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol.\u00a02079. Practice and theory of automated timetabling III: selected papers from the 3rd international conference (pp.\u00a0309\u2013321). Berlin: Springer."},{"issue":"5","key":"77_CR98","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N. Krasnogor","year":"2005","unstructured":"Krasnogor, N., & Smith, J. E. (2005). A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Transactions on Evolutionary Computation, 9(5), 474\u2013488.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"77_CR99","volume-title":"Handbook of scheduling: algorithms, models, and performance","author":"R. Kwan","year":"2004","unstructured":"Kwan, R. (2004). Bus and train driver scheduling. In J. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance. Boca Ratom: CRC Press, Chap. 51."},{"key":"77_CR100","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-642-17144-4_4","volume-title":"Multiple objective meta-heuristics","author":"J. D. Landa Silva","year":"2004","unstructured":"Landa Silva, J. D., Burke, E. K., & Petrovic, S. (2004). An introduction to multi-objective meta-heuristics for scheduling and timetabling. In X. Gandibleux, M. Sevaux, K. Sorensen, & V. Tkindt (Eds.), Lecture notes in economics and mathematical systems : Vol.\u00a0535. Multiple objective meta-heuristics (pp.\u00a091\u2013129). Berlin: Springer."},{"key":"77_CR101","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s10479-006-0064-1","volume":"147","author":"F. Le Hu\u00e9d\u00e9","year":"2006","unstructured":"Le Hu\u00e9d\u00e9, F., Grabisch, M., Labreuche, C., & Sav\u00e9ant, P. (2006). MCS\u2014a new algorithm for multicriteria optimisation in constraint programming. Annals of Operational Research, 147, 143\u2013174.","journal-title":"Annals of Operational Research"},{"key":"77_CR102","volume-title":"Case based reasoning: experiences, lessons, and future directions","author":"D. B. Leake","year":"1996","unstructured":"Leake, D. B. (1996). Case based reasoning: experiences, lessons, and future directions. Menlo Park: AAAI Press\/MIT Press."},{"issue":"1","key":"77_CR103","doi-asserted-by":"crossref","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"},{"key":"77_CR104","unstructured":"Lim, A., Chin, A. J., Kit, H. W., & Oon, W. C. (2000). A campus-wide university examination timetabling application. In Proceedings of the 17th national conference on artificial intelligence and 12th conference on innovative applications of artificial intelligence (pp.\u00a01020\u20131025)."},{"key":"77_CR105","unstructured":"Lin, S. L. M. (2002). A broker algorithm for timetabling problem. In E.\u00a0K. Burke & P.\u00a0De Causmaecker (Eds.), Proceedings of the 4th international conference on practice and theory of automated timetabling, (pp. 372\u2013386), KaHo St.-Lieven, Gent, Belgium, 21\u201323 August 2002."},{"key":"77_CR106","first-page":"321","volume-title":"Handbook of meta-heuristics","author":"H. R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H. R., Martin, O., & St\u00fctzle, T. (2003). Iterated local search. In F. Glover & G. A. Kochenberher (Eds.), Handbook of meta-heuristics (pp. 321\u2013354). Boston: Kluwer Academic."},{"key":"77_CR107","unstructured":"Malim, M. R., Khader, A. T., & Mustafa, A. (2006). Artificial immune algorithms for university timetabling. In E.\u00a0K.\u00a0Burke & H.\u00a0Rudova (Eds.). Proceedings of the 6th international conference on practice and theory of automated timetabling (pp.\u00a0234\u2013245), Brno, Czech Republic, August 2006."},{"key":"77_CR108","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: selected papers from the 6th international conference","author":"B. G. C. McCollum","year":"2007","unstructured":"McCollum, B. G. C. (2007). A perspective on bridging the gap between theory and practice in university timetabling. In E. K. Burke & H.\u00a0Rudova (Eds.), Lecture Notes in Computer Science : Vol.\u00a03867. Practice and theory of automated timetabling VI: selected papers from the 6th international conference (pp.\u00a03\u201323). Berlin: Springer."},{"key":"77_CR109","unstructured":"McCollum, B., McMullan, P., Burke, E. K., Parkes, A. J., & Qu, R. (2008). The second international timetabling competition: examination timetabling track (Technical Report QUB\/IEEE\/Tech\/ITC2007\/Exam\/v1.0\/1). Queen\u2019s Belfast University, N. Ireland."},{"key":"77_CR110","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 colouring method to an examination scheduling problem. Interfaces, 11, 57\u201364.","journal-title":"Interfaces"},{"key":"77_CR111","doi-asserted-by":"crossref","first-page":"185","DOI":"10.2190\/T2A4-GVQW-M5DN-EKCT","volume":"11","author":"N. K. Mehta","year":"1982","unstructured":"Mehta, N. K. (1982). A computer-based examination management system. Journal of Educational Technology Systems, 11, 185\u2013198.","journal-title":"Journal of Educational Technology Systems"},{"key":"77_CR112","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/0-387-28356-0_14","volume-title":"Search methodologies: introductory tutorials in optimisation and decision support techniques","author":"D. Merkle","year":"2005","unstructured":"Merkle, D., & Middendorf, M. (2005). Swarm intelligence. In E.\u00a0K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimisation and decision support techniques (pp.\u00a0401\u2013436). Berlin: Springer."},{"key":"77_CR113","series-title":"Lecture notes in computer science","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: selected papers from the 4th international conference","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 E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science : Vol.\u00a02740. Practice and theory of automated timetabling IV: selected papers from the 4th international conference (pp.\u00a0207\u2013231). Berlin: Springer."},{"issue":"3","key":"77_CR114","first-page":"16","volume":"6","author":"R. Miles","year":"1975","unstructured":"Miles, R. (1975). Computer timetabling: a bibliography. British Journal of Educational Technology, 6(3), 16\u201320.","journal-title":"British Journal of Educational Technology"},{"issue":"11","key":"77_CR115","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., & Hansen, P. (1997). Variable neighbourhood search. Computers and Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers and Operations Research"},{"key":"77_CR116","first-page":"177","volume-title":"Proceedings of the international conference on parallel computing and transputer applications","author":"P. Moscato","year":"1992","unstructured":"Moscato, P., & Norman, M. G. (1992). A \u201cmemetic\u201d approach for the travelling salesman problem\u2014implementation of a computational ecology for combinatorial optimisation on message passing systems. In Proceedings of the international conference on parallel computing and transputer applications (pp.\u00a0177\u2013186). Amsterdam: IOS Press."},{"issue":"1\u20132","key":"77_CR117","first-page":"337","volume":"16","author":"Z. Naji Azimi","year":"2004","unstructured":"Naji Azimi, Z. (2004). Comparison of metaheuristic algorithms for examination timetabling problem. Applied Mathematics and Computation, 16(1\u20132), 337\u2013354.","journal-title":"Applied Mathematics and Computation"},{"issue":"2","key":"77_CR118","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/j.amc.2003.10.061","volume":"163","author":"Z. Naji Azimi","year":"2005","unstructured":"Naji Azimi, Z. (2005). Hybrid heuristics for examination timetabling problem. Applied Mathematics and Computation, 163(2), 705\u2013733.","journal-title":"Applied Mathematics and Computation"},{"key":"77_CR119","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BF02125421","volume":"63","author":"I. H. Osman","year":"1996","unstructured":"Osman, I. H., & Laporte, G. (1996). Metaheuristics: a bibliography. Annals of Operational Research, 63, 513\u2013628.","journal-title":"Annals of Operational Research"},{"key":"77_CR120","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-46004-7_13","volume-title":"Applications of evolutionary computing, EvoWorkshops 2002","author":"L. Paquete","year":"2002","unstructured":"Paquete, L., & St\u00fctzle, T. (2002). An experimental investigation of iterated local search for colouring graphs. In S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf, & G. Raidl (Eds.), Lecture notes in computer science : Vol.\u00a02279. Applications of evolutionary computing, EvoWorkshops 2002 (pp.\u00a0122\u2013131). Berlin: Springer."},{"key":"77_CR121","unstructured":"Paquete, L., & St\u00fctzle, T. (2002). Empirical analysis of tabu search for the lexicographic optimisation of the examination timetabling problem. In E.\u00a0K.\u00a0Burke & P.\u00a0De Causmaecker (Eds.), Proceedings of the 4th international conference on practice and theory of automated timetabling (pp.\u00a0413\u2013420), KaHo St.-Lieven, Gent, Belgium 21\u201323 August 2002."},{"key":"77_CR122","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. Chap.\u00a045."},{"key":"77_CR123","series-title":"Lecture notes in computer science","first-page":"179","volume-title":"Practice and theory of automated timetabling IV: selected papers from the 4th international conference","author":"S. Petrovic","year":"2003","unstructured":"Petrovic, S., & Bykov, Y. (2003). A multi-objective optimisation technique for exam timetabling based on trajectories. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science : Vol.\u00a02740. Practice and theory of automated timetabling IV: selected papers from the 4th international conference (pp.\u00a0179\u2013192). Berlin: Springer."},{"key":"77_CR124","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0377-2217(96)00007-0","volume":"92","author":"M. Pirlot","year":"1996","unstructured":"Pirlot, M. (1996). General local search methods. European Journal of Operational Research, 92, 493\u2013511.","journal-title":"European Journal of Operational Research"},{"key":"77_CR125","unstructured":"Qu, R., & Burke, E. K. (2007). Adaptive decomposition and construction for examination timetabling problems. In Multidisciplinary international scheduling: theory and applications (MISTA\u201907) (pp.\u00a0418\u2013425), Paris, France, August 2007."},{"key":"77_CR126","doi-asserted-by":"crossref","unstructured":"Qu, R., & Burke, E. K. (2008, accepted). Hybridisations within a graph based hyper-heuristic framework for university timetabling problems. Journal of Operational Research Society.","DOI":"10.1057\/jors.2008.102"},{"key":"77_CR127","series-title":"Lecture notes in computer science","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: selected papers from the 6th international conference","author":"D. Ranson","year":"2007","unstructured":"Ranson, D., & Ahmadi, S. (2007). An extensible modelling framework for timetabling problems. In E. K. Burke & H. Rudova (Eds.), Lecture notes in computer science : Vol.\u00a03867. Practice and theory of automated timetabling VI: selected papers from the 6th international conference (pp.\u00a0383\u2013393). Berlin: Springer."},{"key":"77_CR128","volume-title":"Modern heuristic techniques for combinatorial problems","year":"1993","unstructured":"Reeves, C. R. (Ed.). (1993). Modern heuristic techniques for combinatorial problems. Oxford: Scientific Publications."},{"key":"77_CR129","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/0-387-28356-0_19","volume-title":"Search methodologies: introductory tutorials in optimisation and decision support techniques","author":"C. R. Reeves","year":"2005","unstructured":"Reeves, C. R. (2005). Fitness landscapes. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimisation and decision support techniques (pp.\u00a0587\u2013610). Berlin: Springer."},{"key":"77_CR130","unstructured":"Reis, L. P., & Oliveira, E. (1999). Constraint logic programming using set variables for solving timetabling problems. In 12th international conference on applications of Prolog."},{"key":"77_CR131","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/3-540-44629-X_20","volume-title":"Practice and theory of automated timetabling III: selected papers from the 3rd international conference","author":"L. P. Reis","year":"2001","unstructured":"Reis, L. P., & Oliveira, E. (2001). A language for specifying complete timetabling problems. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol. 2079. Practice and theory of automated timetabling III: selected papers from the 3rd international conference (pp.\u00a0322\u2013341). Berlin: Springer."},{"key":"77_CR132","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of meta-heuristics","author":"M. G. C. Resende","year":"2003","unstructured":"Resende, M. G. C., & Ribeiro, C. C. (2003). Greedy randomised adaptive search procedures. In F. Glover & G. A. Kochenberher (Eds.), Handbook of meta-heuristics (pp.\u00a0219\u2013249). Dordrecht: Kluwer."},{"key":"77_CR133","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/inte.12.2.17","volume":"12","author":"B. P. Romero","year":"1982","unstructured":"Romero, B. P. (1982). Examination scheduling in a large engineering school: a computer assisted participative procedure. Interfaces, 12, 17\u201323.","journal-title":"Interfaces"},{"key":"77_CR134","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/0-387-28356-0_17","volume-title":"Search methodologies: introductory tutorials in optimisation and decision support techniques","author":"P. Ross","year":"2005","unstructured":"Ross, P. (2005). Hyper-heuristics. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimisation and decision support techniques (pp.\u00a0529\u2013556). Berlin: Springer. Chap. 17."},{"key":"77_CR135","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/3-540-61794-9_68","volume-title":"Practice and theory of automated timetabling I: selected papers from the 1st international conference","author":"P. Ross","year":"1996","unstructured":"Ross, P., Corne, D., & Terashima-Marin, H. (1996). The phase transition niche for evolutionary algorithms in timetabling. In E.\u00a0K. Burke & P. Ross (Eds.), Lecture notes in computer science : Vol.\u00a01153. Practice and theory of automated timetabling I: selected papers from the 1st international conference (pp.\u00a0309\u2013324). Berlin: Springer."},{"key":"77_CR136","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0055884","volume-title":"Practice and theory of automated timetabling II: selected papers from the 2nd international conference","author":"P. Ross","year":"1998","unstructured":"Ross, P., Hart, E., & Corne, D. (1998). Some observations about GA-based exam timetabling. In E. K. Burke & M. W. Carter (Eds.), Lecture notes in computer science : Vol.\u00a01408. Practice and theory of automated timetabling II: selected papers from the 2nd international conference (pp.\u00a0115\u2013129). Berlin: Springer."},{"key":"77_CR137","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/978-3-642-18965-4_30","volume-title":"Advances in evolutionary computing: theory and applications","author":"P. Ross","year":"2003","unstructured":"Ross, P., Hart, E., & Corne, D. (2003). Genetic algorithms and timetabling. In A. Ghosh & S. Tsutsui (Eds.), Advances in evolutionary computing: theory and applications (pp.\u00a0755\u2013771). New York: Springer."},{"key":"77_CR138","first-page":"1691","volume-title":"Proceedings of the 2004 congress on evolutionary computation (CEC2004)","author":"P. Ross","year":"2004","unstructured":"Ross, P., Marin-Blazquez, J. G., & Hart, E. (2004). Hyper-heuristics applied to class and exam timetabling problems. In Proceedings of the 2004 congress on evolutionary computation (CEC2004) (pp.\u00a01691\u20131698). Washington: IEEE Press."},{"key":"77_CR139","first-page":"689","volume":"37","author":"G. C. W. Sabin","year":"1986","unstructured":"Sabin, G. C. W., & Winter, G. K. (1986). The impact of automated timetabling on universities\u2014a case study. Journal of Operational Research Society, 37, 689\u2013693.","journal-title":"Journal of Operational Research Society"},{"key":"77_CR140","isbn-type":"print","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/0-387-28356-0_4","volume-title":"Search methodologies: introductory tutorials in optimisation and decision support techniques","author":"K. Sastry","year":"2005","unstructured":"Sastry, K., Goldberg, D., & Kendall, G. (2005). Genetic algorithms. In E. K. Burke & G. Kendall (Eds.), Search methodologies: introductory tutorials in optimisation and decision support techniques (pp.\u00a097\u2013125). Berlin: Springer. ISBN: 0387234608.","ISBN":"https:\/\/id.crossref.org\/isbn\/0387234608"},{"issue":"2","key":"77_CR141","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(2), 87\u2013127.","journal-title":"Artificial Intelligence Review"},{"key":"77_CR142","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: selected papers from the 6th international conference","author":"A. Schaerf","year":"2007","unstructured":"Schaerf, A., & Di Gaspero, L. (2007). Measurability and reproducibility in university timetabling research: discussion and proposals. In E. K. Burke & H. Rudova (Eds.), Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI: selected papers from the 6th international conference (pp.\u00a040\u201349). Berlin: Springer."},{"key":"77_CR143","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/comjnl\/23.4.307","volume":"23","author":"E. A. Schmidt","year":"1979","unstructured":"Schmidt, E. A., & Strohlein, T. (1979). Timetable construction\u2014an annotated bibliography. The Computer Journal, 23, 307\u2013316.","journal-title":"The Computer Journal"},{"key":"77_CR144","unstructured":"Sheibani, K. (2002). An evolutionary approach for the examination timetabling problems. In E.\u00a0K. Burke & P. De Causmaecker (Eds.), Proceedings of the 4th international conference on practice and theory of automated timetabling (pp.\u00a0387\u2013396), KaHo St.-Lieven, Gent, Belgium, 21\u201323 August 2002."},{"key":"77_CR145","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/3-540-60299-2_42","volume-title":"First international conference on principles and practice of constraint programming","author":"H. Simonis","year":"1995","unstructured":"Simonis, H. (1995). The CHIP system and its applications. In Lecture notes in computer science : Vol.\u00a0976. First international conference on principles and practice of constraint programming (pp.\u00a0643\u2013646). Berlin: Springer."},{"key":"77_CR146","doi-asserted-by":"crossref","unstructured":"Socha, K., Sampels, M., & Manfrin, M. (2003). Ant algorithms for the university course timetabling problem with regard to state-of-the-art. In Proceedings of the 3rd European workshop on evolutionary computation in combinatorial optimisation (pp.\u00a0334\u2013345), Essex, UK, April 2003.","DOI":"10.1007\/3-540-36605-9_31"},{"key":"77_CR147","unstructured":"Terashima-Marin, H., Ross, P., & Valenzuela-Rendon, M. (1999a). Evolution of constraint satisfaction strategies in examination timetabling. In Proceedings of the genetic and evolutionary conference (pp. 635\u2013642), Orlando, FL."},{"key":"77_CR148","first-page":"1200","volume-title":"Proceedings of 1999 IEEE congress on evolutionary computation","author":"H. Terashima-Marin","year":"1999","unstructured":"Terashima-Marin, H., Ross, P., & Valenzuela-Rendon, M. (1999b). Clique-based crossover for solving the timetabling problem with GAs. In Proceedings of 1999 IEEE congress on evolutionary computation (pp.\u00a01200\u20131206). Washington: IEEE Press."},{"key":"77_CR149","first-page":"604","volume-title":"Proceedings of the congress on evolutionary computation 1999","author":"H. Terashima-Marin","year":"1999","unstructured":"Terashima-Marin, H., Ross, P., & Valenzuela-Rendon, M. (1999c). Application of the hardness theory when solving the timetabling problem with GAs. In Proceedings of the congress on evolutionary computation 1999 (pp.\u00a0604\u2013611). Washington: IEEE Press."},{"key":"77_CR150","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"},{"key":"77_CR151","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1016\/S0305-0548(97)00101-9","volume":"25","author":"J. Thompson","year":"1998","unstructured":"Thompson, J., & Dowsland, K. (1998). A robust simulated annealing based examination timetabling system. Computers & Operations Research, 25, 637\u2013648.","journal-title":"Computers & Operations Research"},{"key":"77_CR152","unstructured":"Tsang, E., Mills, P., & Williams, R. (1999). A computer aided constraint programming system. In The 1st international conference on the practical application of constraint technologies and logic programming (PACLP) (pp.\u00a081\u201393)."},{"key":"77_CR153","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/978-3-540-77345-0_22","volume-title":"Practice and theory of automated timetabling VI: selected papers from the 6th international conference","author":"O. Ulker","year":"2007","unstructured":"Ulker, O., \u00d6zcan, E., & Korkmaz, E. E. (2007). Linear linkage encoding in grouping problems: applications on graph colouring and timetabling. In E. K. Burke & H. Rudova (Eds.), Lecture notes in computer science : Vol.\u00a03867. Practice and theory of automated timetabling VI: selected papers from the 6th international conference (pp.\u00a0347\u2013363). Berlin: Springer."},{"key":"77_CR154","series-title":"Logic programming series","volume-title":"Constraint satisfaction in logic programming","author":"P. Hentenryck Van","year":"1989","unstructured":"Van Hentenryck, P. (1989). Logic programming series. Constraint satisfaction in logic programming. Cambridge: MIT Press."},{"key":"77_CR155","volume-title":"The OPL optimisation programming language","author":"P. Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P. (1999). The OPL optimisation programming language. Cambridge: MIT Press."},{"key":"77_CR156","first-page":"41","volume":"11","author":"D. J. A. Welsh","year":"1967","unstructured":"Welsh, D. J. A., & Powell, M. B. (1967). The upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 11, 41\u201347.","journal-title":"The Computer Journal"},{"key":"77_CR157","unstructured":"White, G. M. (2000). Constrained satisfaction, not so constrained satisfaction and the timetabling problem. In E.\u00a0K. Burke & W.\u00a0Erben (Eds.) , Proceedings of the 3rd international conference on the practice and theory of automated timetabling (pp.\u00a032\u201347), Constance, Germany, 16\u201318 August 2000."},{"key":"77_CR158","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-44629-X_6","volume-title":"Practice and theory of automated timetabling III: selected papers from the 3rd international conference","author":"G. M. White","year":"2001","unstructured":"White, G. M., & Xie, B. S. (2001). Examination timetables and tabu search with longer-term memory. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol.\u00a02079. Practice and theory of automated timetabling III: selected papers from the 3rd international conference (pp.\u00a085\u2013103). Berlin: Springer."},{"issue":"16","key":"77_CR159","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0377-2217(03)00100-0","volume":"153","author":"G. M. White","year":"2004","unstructured":"White, G. M., Xie, B. S., & Zonjic, S. (2004). Using tabu search with longer-term memory and relaxation to create examination timetables. European Journal of Operational Research, 153(16), 80\u201391.","journal-title":"European Journal of Operational Research"},{"key":"77_CR160","doi-asserted-by":"crossref","unstructured":"Wong, T., C\u00f4t\u00e9, P., & Gely, P. (2002). Final exam timetabling: a practical approach. In IEEE Canadian conference on electrical and computer engineering (CCECE 2002) (Vol.\u00a02, pp.\u00a0726\u2013731).","DOI":"10.1109\/CCECE.2002.1013031"},{"issue":"1","key":"77_CR161","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(1), 41\u201347.","journal-title":"The Computer Journal"},{"key":"77_CR162","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1007\/3-540-61794-9_51","volume-title":"Practice and theory of automated timetabling I: selected papers from the 1st international conference","author":"A. Wren","year":"1996","unstructured":"Wren, A. (1996). Scheduling, timetabling and rostering\u2014a special relationship? In E. K. Burke & P. Ross (Eds.), Lecture notes in computer science : Vol. 1153. Practice and theory of automated timetabling I: selected papers from the 1st international conference (pp.\u00a046\u201375). Berlin: Springer."},{"key":"77_CR163","series-title":"Lecture notes in computer science","first-page":"377","volume-title":"Practice and theory of automated timetabling V: 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.\u00a03616. Practice and theory of automated timetabling V: selected papers from the 5th international conference (pp.\u00a0377\u2013396). Berlin: Springer."},{"issue":"4","key":"77_CR164","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/0305-0548(74)90064-1","volume":"1","author":"M. Zeleny","year":"1974","unstructured":"Zeleny, M. (1974). A concept of compromise solutions and method of displaced ideal. Computers & Operations Research, 1(4), 479\u2013496.","journal-title":"Computers & Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0077-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0077-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0077-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T16:21:05Z","timestamp":1589041265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0077-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,29]]},"references-count":164,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["77"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0077-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,29]]}}}