{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T05:22:16Z","timestamp":1775366536125,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T00:00:00Z","timestamp":1283644800000},"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,7]]},"DOI":"10.1007\/s10479-010-0782-2","type":"journal-article","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T01:05:37Z","timestamp":1283562337000},"page":"73-90","source":"Crossref","is-referenced-by-count":50,"title":["Monte Carlo hyper-heuristics for examination timetabling"],"prefix":"10.1007","volume":"196","author":[{"given":"Edmund K.","family":"Burke","sequence":"first","affiliation":[]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[]},{"given":"Mustafa","family":"M\u0131s\u0131r","sequence":"additional","affiliation":[]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,5]]},"reference":[{"key":"782_CR1","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. (2007). A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem. Journal of the Operational Research Society, 58, 1494\u20131502.","journal-title":"Journal of the Operational Research Society"},{"key":"782_CR2","doi-asserted-by":"crossref","unstructured":"Alkan, A., & \u00d6zcan, E. (2003). Memetic algorithms for timetabling. In Proc. of the congress on evolutionary computation (Vol.\u00a03, pp. 1796\u20131802).","DOI":"10.1109\/CEC.2003.1299890"},{"key":"782_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. M. (2005). Fuzzy multiple ordering criteria for examination timetabling. In Lecture notes in computer science : Vol. 3616. Selected papers from the 5th international conference on the practice and theory of automated timetabling (pp.\u00a0334\u2013353). Berlin: Springer."},{"key":"782_CR4","unstructured":"Ayob, M., & Kendall, G. (2003). A Monte Carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. In Proceedings of the international conference on intelligent technologies (InTech\u201903), Chiang Mai, Thailand (pp.\u00a0132\u2013141)."},{"issue":"2","key":"782_CR5","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/j.amc.2003.10.061","volume":"163","author":"Z. N. Azimi","year":"2005","unstructured":"Azimi, Z. N. (2005). Hybrid heuristics for examination timetabling problem. Applied Mathematics and Computation, 163(2), 705\u2013733.","journal-title":"Applied Mathematics and Computation"},{"key":"782_CR6","series-title":"Operations research\/computer science interface series","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/0-387-25383-1_4","volume-title":"Metaheuristics: progress as real problem solver","author":"R. Bai","year":"2005","unstructured":"Bai, R., & Kendall, G. (2005). An investigation of automated planograms using a simulated annealing based hyper-heuristics. In T. Ibaraki, K. Nonobe, & M. Yagiura (Eds.), Operations research\/computer science interface series : Vol. 32. Metaheuristics: progress as real problem solver (pp. 87\u2013108). Berlin: Springer."},{"key":"782_CR7","unstructured":"Bai, R., Blazewicz, J., Burke, E. K., Kendall, G., & McCollum, B. (2007). A simulated annealing hyper-heuristic methodology for flexible decision support (Tech. Rep. NOTTCS-TR-2007-8). School of CSiT, University of Nottingham."},{"key":"782_CR8","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 (PATAT 2006)","author":"B. Bilgin","year":"2007","unstructured":"Bilgin, B., \u00d6zcan, E., & Korkmaz, E. E. (2007). An experimental study on hyper-heuristics and exam timetabling. In Lecture notes in computer science : Vol. 3867. Practice and theory of automated timetabling VI (PATAT 2006) (pp. 394\u2013412). Berlin: Springer."},{"key":"782_CR9","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"},{"issue":"1","key":"782_CR10","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 multistage evolutionary algorithm for the timetable problem. IEEE Trans Evolutionary Computation, 3(1), 63\u201374.","journal-title":"IEEE Trans Evolutionary Computation"},{"key":"782_CR11","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 adaption of heuristic orderings. Annals of Operations Research, 129, 107\u2013134.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"782_CR12","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":"782_CR13","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-61794-9_63","volume-title":"Selected papers from the first international conference on practice and theory of automated timetabling","author":"E. K. Burke","year":"1996","unstructured":"Burke, E. K., Newall, J. P., & Weare, R. F. (1996a). A memetic algorithm for university exam timetabling. In Lecture notes in computer science : Vol. 1153. Selected papers from the first international conference on practice and theory of automated timetabling (pp. 241\u2013250). Berlin: Springer."},{"key":"782_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-61794-9_52","volume-title":"Selected papers from the first international conference on practice and theory of automated timetabling","author":"E. K. Burke","year":"1996","unstructured":"Burke, E. K., Elliman, D. G., Ford, P. H., & Weare, R. F. (1996b). Examination timetabling in British universities: a survey. In Lecture notes in computer science : Vol. 1153. Selected papers from the first international conference on practice and theory of automated timetabling (pp. 76\u201390). Berlin: Springer."},{"key":"782_CR15","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of metaheuristics","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., Hart, E., Kendall, G., Newall, J., Ross, P., & Schulenburg, S. (2003). Hyper-heuristics: An emerging direction in modern search technology. In F. Glover & G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 457\u2013474). Norwell: Kluwer Academic."},{"key":"782_CR16","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1007\/11844297_87","volume-title":"Proceedings of the 9th international conference on parallel problem solving from nature (PPSN 2006)","author":"E. K. Burke","year":"2006","unstructured":"Burke, E. K., Hyde, M. R., & Kendall, G. (2006). Evolving bin packing heuristics with genetic programming. In Lecture notes in computer science : Vol. 4193. Proceedings of the 9th international conference on parallel problem solving from nature (PPSN 2006), Reykjavik, Iceland (pp. 860\u2013869). Berlin: Springer."},{"key":"782_CR17","doi-asserted-by":"crossref","first-page":"1559","DOI":"10.1145\/1276958.1277273","volume-title":"GECCO \u201907: proceedings of the 9th annual conference on genetic and evolutionary computation","author":"E. K. Burke","year":"2007","unstructured":"Burke, E. K., Hyde, M. R., Kendall, G., & Woodward, J. (2007a). Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one. In GECCO \u201907: proceedings of the 9th annual conference on genetic and evolutionary computation (pp. 1559\u20131565). New York: ACM. doi: 10.1145\/1276958.1277273 ."},{"issue":"1","key":"782_CR18","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. (2007b). A graph-based hyper-heuristic for educational timetabling problems. European Journal of Operational Research, 176(1), 177\u2013192.","journal-title":"European Journal of Operational Research"},{"key":"782_CR19","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-44691-5_20","volume-title":"WAE \u201900: the 4th international workshop on algorithm engineering","author":"M. Caramia","year":"2001","unstructured":"Caramia, M., Dell\u2019Olmo, P., & Italiano, G. F. (2001). New algorithms for examination timetabling. In Lecture notes in computer science : Vol. 1982. WAE \u201900: the 4th international workshop on algorithm engineering (pp. 230\u2013242). London: Springer."},{"issue":"1","key":"782_CR20","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/ijoc.1070.0220","volume":"20","author":"M. Caramia","year":"2008","unstructured":"Caramia, M., Dellolmo, P., & Italiano, G. F. (2008). Novel local search-based approaches to university examination timetabling. INFORMS Journal on Computing, 20(1), 86\u201399.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"782_CR21","first-page":"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 Society of America, 34(2), 193\u2013202.","journal-title":"Operations Research Society of America"},{"key":"782_CR22","series-title":"Lecture notes in computer science","first-page":"373","volume-title":"Selected papers from the first international conference on practice and theory of automated timetabling","author":"M. W. Carter","year":"1996","unstructured":"Carter, M. W., & Laporte, G. (1996). Recent developments in practical examination timetabling. In Lecture notes in computer science : Vol. 1153. Selected papers from the first international conference on practice and theory of automated timetabling (pp. 373\u2013383). Berlin: Springer."},{"issue":"3","key":"782_CR23","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. (1996). Examination timetabling: Algorithmic strategies and applications. Journal of the Operational Research Society, 47(3), 373\u2013383.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"782_CR24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00940812","volume":"45","author":"V. Cerny","year":"1985","unstructured":"Cerny, V. (1985). Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45(1), 41\u201351.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"782_CR25","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1093\/comjnl\/7.2.117","volume":"7","author":"A. J. Cole","year":"1964","unstructured":"Cole, A. J. (1964). The preparation of examination timetables using a small-store computer. The Computer Journal, 7, 117\u2013121.","journal-title":"The Computer Journal"},{"key":"782_CR26","doi-asserted-by":"crossref","unstructured":"Corne, D., Ross, P., & Fang, H. L. (1994). Fast practical evolutionary timetabling. In Selected papers from AISB workshop on evolutionary computing (pp.\u00a0250\u2013263).","DOI":"10.1007\/3-540-58483-8_19"},{"key":"782_CR27","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 Parallel problem solving from nature\u2014PPSN IX (pp.\u00a0392\u2013401).","DOI":"10.1007\/11844297_40"},{"key":"782_CR28","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"PATAT \u201900: selected papers from the third international conference on practice and theory of automated timetabling III","author":"P. Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., & Soubeiga, E. (2001a). A hyperheuristic approach to scheduling a sales summit. In PATAT \u201900: selected papers from the third international conference on practice and theory of automated timetabling III (pp. 176\u2013190). London: Springer."},{"key":"782_CR29","doi-asserted-by":"crossref","unstructured":"Cowling, P., Kendall, G., & Soubeiga, E. (2001b). A parameter-free hyperheuristic for scheduling a sales summit. In Proceedings of the 4th metaheuristic international conference (pp.\u00a0127\u2013131).","DOI":"10.1007\/3-540-44629-X_11"},{"key":"782_CR30","series-title":"Lecture notes in computer science","first-page":"1","volume-title":"EvoWorkShops","author":"P. Cowling","year":"2002","unstructured":"Cowling, P., Kendall, G., & Soubeiga, E. (2002). Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation. In Lecture notes in computer science : Vol. 4193. EvoWorkShops (pp. 1\u201310). Berlin: Springer."},{"issue":"4","key":"782_CR31","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1057\/palgrave.jors.2601830","volume":"56","author":"K. Dowsland","year":"2005","unstructured":"Dowsland, K., & Thompson, J. (2005). Ant colony optimization for the examination scheduling problem. Journal of the Operational Research Society, 56(4), 426\u2013438.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"782_CR32","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1016\/j.ejor.2005.03.058","volume":"179","author":"K. A. Dowsland","year":"2007","unstructured":"Dowsland, K. A., Soubeiga, E., & Burke, E. (2007). A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation. European Journal of Operational Research, 179(3), 759\u2013774.","journal-title":"European Journal of Operational Research"},{"key":"782_CR33","unstructured":"Eley, M. (2006). Ant algorithms for the exam timetabling problem. In Proc. of the 5th international conference on the practice and theory of automated timetabling (pp. 364\u2013382)."},{"key":"782_CR34","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/3-540-61794-9_61","volume-title":"Practice and theory of automated timetabling","author":"A. Ergul","year":"1996","unstructured":"Ergul, A. (1996). Ga-based examination scheduling experience at middle east technical university. In Lecture notes in computer science : Vol. 1153. Practice and theory of automated timetabling (pp. 212\u2013226). Berlin: Springer."},{"key":"782_CR35","unstructured":"Ersoy, E., \u00d6zcan, E., & Uyar, S. (2007). Memetic algorithms and hyperhill-climbers. In Proc. of the 3rd multidisciplinary int. conf. on scheduling: theory and applications (MISTA\u201907) (pp. 159\u2013166)."},{"issue":"4","key":"782_CR36","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., & Shamir, A. (1976). On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing, 5(4), 691\u2013703.","journal-title":"SIAM Journal on Computing"},{"key":"782_CR37","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-44629-X_7","volume-title":"Third international conference on practice and theory of automated timetabling, PATAT2000","author":"L. D. Gaspero","year":"2001","unstructured":"Gaspero, L. D., & Schaerf, A. (2001). Tabu search techniques for examination timetabling. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science : Vol. 2079. Third international conference on practice and theory of automated timetabling, PATAT2000 (pp. 104\u2013117). Berlin: Springer."},{"key":"782_CR38","author":"C. Gogos","year":"2010","unstructured":"Gogos, C., Alefragis, P., & Housos, E. (2010). An improved multi-staged algorithmic process for the solution of the examination timetabling problem. Annals of Operations Research. doi: 10.1007\/s10479-010-0712-3 .","journal-title":"Annals of Operations Research"},{"key":"782_CR39","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg, DE (1989). Genetic algorithms in search, optimization and machine learning. Boston: Addison-Wesley."},{"key":"782_CR40","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1613\/jair.301","volume":"4","author":"L. P. Kaelbling","year":"1996","unstructured":"Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996). Reinforcement learning: a survey. Journal of Artificial Intelligence Research, 4, 237\u2013285.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"782_CR41","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/11593577_16","volume-title":"Practice and theory of automated timetabling V","author":"G. Kendall","year":"2005","unstructured":"Kendall, G., & Hussin, N. M. (2005). A tabu search hyper-heuristic approach to the examination timetabling problem at the Mara University of Technology. In Lecture notes in computer science : Vol. 3616. Practice and theory of automated timetabling V (pp. 270\u2013293). Berlin: Springer."},{"key":"782_CR42","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"issue":"1","key":"782_CR43","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:NACO.0000023419.83147.67","volume":"3","author":"N. Krasnogor","year":"2004","unstructured":"Krasnogor, N., & Gustafson, S. (2004). A study on the use of \u2018self-generation\u2019 in memetic algorithms. Natural Computing, 3(1), 53\u201376.","journal-title":"Natural Computing"},{"key":"782_CR44","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F. T. Leighton","year":"1979","unstructured":"Leighton, F. T. (1979). A\u00a0graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 84, 489\u2013506.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"782_CR45","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01582166","volume":"34","author":"M. Lundy","year":"1986","unstructured":"Lundy, M., & Mees, A. (1986). Convergence of an annealing algorithm. Mathematical Programming, 34, 111\u2013124.","journal-title":"Mathematical Programming"},{"key":"782_CR46","unstructured":"Marin, H. T. (1998). Combinations of ga and csp strategies for solving the examination timetabling problem (PhD thesis). Instituto Technologico y de Estudios Superiores de Monterrey."},{"key":"782_CR47","first-page":"15","volume-title":"Proc. of the 5th international conference on the practice and theory of automated timetabling","author":"B. McCollum","year":"2006","unstructured":"McCollum, B. (2006). University timetabling: Bridging the gap between research and practice. In Proc. of the 5th international conference on the practice and theory of automated timetabling (pp. 15\u201335). Berlin: Springer."},{"key":"782_CR48","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B. McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., Gaspero, L., Qu, R., & Burke, E. K. (2010). Setting the research agenda in automated timetabling: the second international timetabling competition. INFORMS Journal on Computing, 22, 120\u2013130.","journal-title":"INFORMS Journal on Computing"},{"key":"782_CR49","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, PATAT 2002","author":"L. T. Merlot","year":"2003","unstructured":"Merlot, L. T., Boland, N., Hughes, B. D., & Stuckey, P. J. (2003). A hybrid algorithm for the examination timetabling problem. In Lecture notes in computer science : Vol. 1153. Practice and theory of automated timetabling IV, PATAT 2002 (pp. 207\u2013231). Berlin: Springer."},{"issue":"1","key":"782_CR50","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T. M\u00fcller","year":"2009","unstructured":"M\u00fcller, T. (2009). Itc2007 solver description: A hybrid approach. Annals of Operations Research, 172(1), 429\u2013446.","journal-title":"Annals of Operations Research"},{"key":"782_CR51","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/978-1-4757-4137-7_25","volume-title":"Metaheuristics: computer decision-making","author":"A. Nareyek","year":"2003","unstructured":"Nareyek, A. (2003). Choosing search heuristics by non-stationary reinforcement learning. In M. G. C. Resende & J. P. de Sousa (Eds.), Metaheuristics: computer decision-making (pp. 523\u2013544). Norwell: Kluwer Academic, Chap.\u00a09."},{"issue":"1","key":"782_CR52","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"Y. S. Ong","year":"2006","unstructured":"Ong, Y. S., Lim, M. H., Zhu, N., & Wong, K. W. (2006). Classification of adaptive memetic algorithms: a comparative study. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 36(1), 141\u2013152.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B"},{"key":"782_CR53","unstructured":"\u00d6zcan, E., & Alkan, A. (2007). A memetic algorithm for solving a timetabling problem: An incremental strategy. In: P. Baptiste, G. Kendall, A.M. Kordon & F. Sourd (Eds.), Proc. of the 3rd multidisciplinary int. conf. on scheduling: theory and applications (pp. 394\u2013401)."},{"key":"782_CR54","first-page":"1356","volume-title":"Proc. of the congress on evolutionary computation","author":"E. \u00d6zcan","year":"2005","unstructured":"\u00d6zcan, E., & Ersoy, E. (2005). Final exam scheduler\u2014fes. In Proc. of the congress on evolutionary computation (pp. 1356\u20131363). New York: IEEE Press."},{"key":"782_CR55","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1007\/11844297_21","volume-title":"Proceedings of the 9th international conference on parallel problem solving from nature (PPSN 2006)","author":"E. \u00d6zcan","year":"2006","unstructured":"\u00d6zcan, E., Bilgin, B., & Korkmaz, E. E. (2006). Hill climbers and mutational heuristics in hyperheuristics. In Lecture notes in computer science : Vol. 4193. Proceedings of the 9th international conference on parallel problem solving from nature (PPSN 2006), Reykjavik, Iceland (pp. 202\u2013211). Berlin: Springer."},{"issue":"1","key":"782_CR56","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E. \u00d6zcan","year":"2008","unstructured":"\u00d6zcan, E., Bilgin, B., & Korkmaz, E. E. (2008). A comprehensive survey of hyperheuristics. Intelligent Data Analysis, 12(1), 3\u201323.","journal-title":"Intelligent Data Analysis"},{"key":"782_CR57","unstructured":"Paquete, L. F., & Fonseca, C. M. (2001). A study of examination timetabling with multiobjective evolutionary algorithms. In Proc. of the 4th metaheuristics international conference (MIC 2001) (pp. 149\u2013154)."},{"key":"782_CR58","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/11593577_18","volume-title":"The 5th int. conf. on the practice and theory of automated timetabling","author":"S. Petrovic","year":"2005","unstructured":"Petrovic, S., Patel, V., & Yang, Y. (2005). Examination timetabling with fuzzy constraints. In Lecture notes in computer science : Vol. 3616. The 5th int. conf. on the practice and theory of automated timetabling (pp. 313\u2013333). Berlin: Springer."},{"issue":"3","key":"782_CR59","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1016\/j.eswa.2006.06.017","volume":"33","author":"S. Petrovic","year":"2007","unstructured":"Petrovic, S., Yang, Y., & Dror, M. (2007). Case-based selection of initialisation heuristics for metaheuristic examination timetabling. Expert Systems with Applications, 33(3), 772\u2013785.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"782_CR60","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., & Lee, S. (2009). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12(1), 55\u201389.","journal-title":"Journal of Scheduling"},{"key":"782_CR61","first-page":"556","volume-title":"PPSN III: proceedings of the international conference on evolutionary computation. The third conference on parallel problem solving from nature","author":"P. Ross","year":"1994","unstructured":"Ross, P., Corne, D., & Fang, H. L. (1994). Improving evolutionary timetabling with delta evaluation and directed mutation. In PPSN III: proceedings of the international conference on evolutionary computation. The third conference on parallel problem solving from nature (pp. 556\u2013565). London: Springer."},{"issue":"2","key":"782_CR62","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":"782_CR63","unstructured":"Schaerf, A. & Gaspero, L.D. (2006). Measurability and reproducibility in timetabling research: State-of the-art and discussion (invited paper). In Proc. of the 6th int. conf. on the practice and theory of automated timetabling (pp. 53\u201362)."},{"key":"782_CR64","doi-asserted-by":"crossref","unstructured":"Wong, T., Cote, P., & Gely, P. (2002). Final exam timetabling: a practical approach. In Proc. of the IEEE canadian conference on electrical and computer engineering (Vol.\u00a02, pp. 726\u2013731).","DOI":"10.1109\/CCECE.2002.1013031"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0782-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-010-0782-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-010-0782-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T06:07:32Z","timestamp":1636351652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-010-0782-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,5]]},"references-count":64,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["782"],"URL":"https:\/\/doi.org\/10.1007\/s10479-010-0782-2","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,5]]}}}