{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T05:22:18Z","timestamp":1775366538141,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,10,13]],"date-time":"2011-10-13T00:00:00Z","timestamp":1318464000000},"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":[[2014,7]]},"DOI":"10.1007\/s10479-011-0999-8","type":"journal-article","created":{"date-parts":[[2011,10,12]],"date-time":"2011-10-12T13:17:49Z","timestamp":1318425469000},"page":"3-21","source":"Crossref","is-referenced-by-count":17,"title":["A constructive approach to examination timetabling based on adaptive decomposition and ordering"],"prefix":"10.1007","volume":"218","author":[{"given":"Syariza","family":"Abdul-Rahman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edmund K.","family":"Burke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Bargiela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"McCollum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,13]]},"reference":[{"key":"999_CR1","first-page":"727","volume-title":"Proceedings of the 24th international symposium on computer and information sciences","author":"S. Abdul\u00a0Rahman","year":"2009","unstructured":"Abdul\u00a0Rahman, S., Bargiela, A., Burke, E. K., McCollum, B., & \u00d6zcan, E. (2009). Construction of examination timetables based on ordering heuristics. In Proceedings of the 24th international symposium on computer and information sciences (pp. 727\u2013732)."},{"key":"999_CR2","first-page":"353","volume-title":"Proceedings of the 8th international conference on the practice and theory of automated timetabling","author":"S. Abdul\u00a0Rahman","year":"2010","unstructured":"Abdul\u00a0Rahman, S., Bargiela, A., Burke, E. K., McCollum, B., & \u00d6zcan, E. (2010). A constructive approach for examination timetabling based on adaptive decomposition and ordering. In Proceedings of the 8th international conference on the practice and theory of automated timetabling (pp. 353\u2013372)."},{"issue":"2","key":"999_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. (2007). Investigating Ahuja-Orlin\u2019s large neighbourhood search approach for examination timetabling. OR-Spektrum, 29(2), 351\u2013372.","journal-title":"OR-Spektrum"},{"issue":"4","key":"999_CR4","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1016\/j.cor.2007.12.007","volume":"36","author":"H. Asmuni","year":"2009","unstructured":"Asmuni, H., Burke, E. K., Garibaldi, J. M., McCollum, B., & Parkes, A. J. (2009). An investigation of fuzzy multiple heuristic orderings in the construction of university examination timetables. Computers & Operations Research, 36(4), 981\u20131001.","journal-title":"Computers & Operations Research"},{"key":"999_CR5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1016\/0305-0548(92)90066-E","volume":"19","author":"N. Balakrishnan","year":"1992","unstructured":"Balakrishnan, N., Lucena, A., & Wong, R. T. (1992). Scheduling examinations to reduce second order conflicts. Computers & Operations Research, 19, 353\u2013361.","journal-title":"Computers & Operations Research"},{"key":"999_CR6","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 scheduling. 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. 394\u2013412). Berlin: Springer."},{"issue":"2","key":"999_CR7","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. The Journal of Logic Programming, 26(2), 217\u2013233.","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"999_CR8","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1109\/4235.752921","volume":"3","author":"E. K. Burke","year":"1999","unstructured":"Burke, E. K., & Newall, J. P. (1999). A multistage evolutionary algorithm for the timetable problem. IEEE Transactions on Evolutionary Computation, 3(1), 63\u201374.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"999_CR9","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 Lecture notes in computer science: Vol. 2740. Practice and theory of automated timetabling IV: selected papers from the 4th international conference (pp. 195\u2013206). Berlin: Springer."},{"key":"999_CR10","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 Operations Research, 129, 107\u2013134.","journal-title":"Annals of Operations Research"},{"key":"999_CR11","volume-title":"The proceedings of the 6th international conference on genetic algorithms (ICGA\u201995)","author":"E. K. Burke","year":"1995","unstructured":"Burke, E. K., Elliman, D. G., & Weare, R. (1995). A hybrid genetic algorithm for highly constrained timetabling problems. In The proceedings of the 6th international conference on genetic algorithms (ICGA\u201995), San Francisco, CA, USA, Pittsburgh, USA."},{"key":"999_CR12","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. (2003). Hyper-heuristics: an emerging direction in modern search technology. In F. Glover & G. Kochenberger (Eds.), Handbook of meta-heuristics (pp. 457\u2013474). Dordrecht: Kluwer."},{"issue":"6","key":"999_CR13","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 problem. IIE Transactions, 36(6), 509\u2013528.","journal-title":"IIE Transactions"},{"key":"999_CR14","first-page":"445","volume-title":"Handbook of graph theory","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., Kingston, J., & de Werra, D. (2004b). Applications to timetabling. In J. Gross & J. Yellen (Eds.), Handbook of graph theory (pp. 445\u2013474). London: Chapman Hall\/CRC Press."},{"issue":"2","key":"999_CR15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10951-006-6775-y","volume":"9","author":"E. K. Burke","year":"2006","unstructured":"Burke, E. K., Petrovic, S., & Qu, R. (2006). Case based heuristic selection for timetabling problems. Journal of Scheduling, 9(2), 115\u2013132.","journal-title":"Journal of Scheduling"},{"issue":"1","key":"999_CR16","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ejor.2010.01.044","volume":"206","author":"E. K. Burke","year":"2010","unstructured":"Burke, E. K., Eckersley, A. J., McCollum, B., Petrovic, S., & Qu, R. (2010a). Hybrid variable neighbourhood approaches to university exam timetabling. European Journal of Operational Research, 206(1), 46\u201353.","journal-title":"European Journal of Operational Research"},{"key":"999_CR17","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Kendall, G., Misir, M., & \u00d6zcan, E. (2010b). Monte Carlo hyper-heuristics for examination timetabling. Annals of Operations Research. doi: 10.1007\/s10479-010-0782-2 .","DOI":"10.1007\/s10479-010-0782-2"},{"key":"999_CR18","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Pham, N., Qu, R., & Yellen, J. (2010c). Linear combinations of heuristics for examination timetabling. Annals of Operations Research. doi: 10.1007\/s10479-011-0854-y .","DOI":"10.1007\/s10479-011-0854-y"},{"key":"999_CR19","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 on Computing, 20, 86\u201399.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"999_CR20","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. Operational Research, 34(2), 193\u2013202.","journal-title":"Operational Research"},{"key":"999_CR21","first-page":"3","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 Selected papers from the first international conference on practice and theory of automated timetabling (pp. 3\u201321). London: Springer."},{"issue":"3","key":"999_CR22","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. The Journal of the Operational Research Society, 47(3), 373\u2013383.","journal-title":"The Journal of the Operational Research Society"},{"key":"999_CR23","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-540-39624-6_19","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 Lecture notes in computer science: Vol. 2740. Practice and theory of automated timetabling IV: selected papers from the 4th international conference (pp. 234\u2013244). Berlin: Springer."},{"key":"999_CR24","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/11844297_40","volume-title":"Parallel problem solving from nature\u2014PPSN IX","author":"P. Corr","year":"2006","unstructured":"Corr, P., McCollum, B., McGreevy, M., & McMullan, P. (2006). A new neural network based construction heuristic for the examination timetabling problem. In Lecture notes in computer science: Vol. 4193. Parallel problem solving from nature\u2014PPSN IX (pp. 392\u2013401). Berlin: Springer."},{"key":"999_CR25","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. 1408. Practice and theory of automated timetabling II: selected papers from the 2nd international conference (pp. 169\u2013186). Berlin: Springer."},{"key":"999_CR26","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. Gaspero Di","year":"2001","unstructured":"Di Gaspero, L., & Schaerf, A. (2001). Tabu search techniques for examination timetabling. In Lecture notes in computer science. Practice and theory of automated timetabling III: selected papers from the 3rd international conference (pp. 104\u2013117). Berlin: Springer."},{"key":"999_CR27","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. 3867. Practice and theory of automated timetabling VI: selected papers from the 6th international conference (pp. 364\u2013382). Berlin: Springer."},{"key":"999_CR28","series-title":"Lecture notes in computer science","first-page":"159","volume-title":"Multidisciplinary international conference on scheduling: theory and applications: selected papers from the 3rd international conference","author":"E. Ersoy","year":"2007","unstructured":"Ersoy, E., \u00d6zcan, E., & Sima\u00a0Uyar, A. (2007). Memetic algorithms and hyperhill-climbers. In P. Baptiste, G. Kendall, A. M. Kordon, & F. Sourd (Eds.), Lecture notes in computer science. Multidisciplinary international conference on scheduling: theory and applications: selected papers from the 3rd international conference (pp. 159\u2013166). Berlin: Springer."},{"key":"999_CR29","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.561","volume":"10","author":"D. E. Joslin","year":"1999","unstructured":"Joslin, D. E., & Clements, D. P. (1999). \u201cSqueaky wheel\u201d optimization. The Journal of Artificial Intelligence Research, 10, 353\u2013357.","journal-title":"The Journal of Artificial Intelligence Research"},{"key":"999_CR30","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 V: 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 & W. Erben (Eds.), Lecture notes in computer science: Vol. 2740. Practice and theory of automated timetabling V: selected papers from the 4th international conference (pp. 207\u2013231). Berlin: Springer."},{"issue":"1","key":"999_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10479-008-0490-3","volume":"180","author":"C. L. Mumford","year":"2010","unstructured":"Mumford, C. L. (2010). A multiobjective framework for heavily constrained examination timetabling problems. Annals of Operations Research, 180(1), 3\u201331.","journal-title":"Annals of Operations Research"},{"key":"999_CR32","doi-asserted-by":"crossref","first-page":"1356","DOI":"10.1109\/CEC.2005.1554848","volume-title":"Proceedings of the IEEE congress on evolutionary computation (CEC\u201905)","author":"E. \u00d6zcan","year":"2005","unstructured":"\u00d6zcan, E., & Ersoy, E. (2005). Final exam scheduler\u2014FES. In Proceedings of the IEEE congress on evolutionary computation (CEC\u201905) (Vol.\u00a02, pp. 1356\u20131363)."},{"issue":"1","key":"999_CR33","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 analysis of hyper-heuristics. Intelligent Data Analysis, 12(1), 3\u201323.","journal-title":"Intelligent Data Analysis"},{"key":"999_CR34","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1109\/CEC.2009.4983054","volume-title":"Proceedings of the 2009 IEEE congress on evolutionary computation (CEC 2009)","author":"E. \u00d6zcan","year":"2009","unstructured":"\u00d6zcan, E., Bykov, Y., Birben, M., & Burke, E. K. (2009). Examination timetabling using late acceptance hyper-heuristics. In Proceedings of the 2009 IEEE congress on evolutionary computation (CEC 2009), Trondheim, Norway (pp. 997\u20131004). New York: IEEE Press."},{"issue":"1","key":"999_CR35","doi-asserted-by":"crossref","first-page":"39","DOI":"10.4018\/jamc.2010102603","volume":"1","author":"E. \u00d6zcan","year":"2010","unstructured":"\u00d6zcan, E., Misir, M., Ochoa, G., & Burke, E. K. (2010). A reinforcement learning\u2014great-deluge hyper-heuristic for examination timetabling. International Journal of Applied Metaheuristic Computing, 1(1), 39\u201359.","journal-title":"International Journal of Applied Metaheuristic Computing"},{"key":"999_CR36","first-page":"413","volume-title":"The proceedings of the 4th international conference on the practice and theory of automated timetabling (PATAT IV)","author":"L. Paquete","year":"2002","unstructured":"Paquete, L., & Stuetzle, T. (2002). Empirical analysis of tabu search for the lexicographic optimization of the examination timetabling problem. In The proceedings of the 4th international conference on the practice and theory of automated timetabling (PATAT IV), Gent, Belgium (pp. 413\u2013420)."},{"key":"999_CR37","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis, Chap.\u00a045","author":"S. Petrovic","year":"2004","unstructured":"Petrovic, S., & Burke, E. (2004). University timetabling. In Handbook of scheduling: algorithms, models, and performance analysis, Chap.\u00a045. London: Chapman Hall\/CRC Press."},{"key":"999_CR38","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 multiobjective optimisation technique for exam timetabling based on trajectories. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science: Vol. 2740. Practice and theory of automated timetabling IV: selected papers from the 4th international conference (pp. 179\u2013192). Berlin: Springer."},{"issue":"2","key":"999_CR39","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.ejor.2008.07.023","volume":"197","author":"N. Pillay","year":"2009","unstructured":"Pillay, N., & Banzhaf, W. (2009). A study of heuristic combinations for hyper-heuristic systems for the uncapacitated examination timetabling problem. European Journal of Operational Research, 197(2), 482\u2013491.","journal-title":"European Journal of Operational Research"},{"key":"999_CR40","first-page":"418","volume-title":"Multidisciplinary international scheduling: theory and applications (MISTA\u201907)","author":"R. Qu","year":"2007","unstructured":"Qu, R., & Burke, E. K. (2007). Adaptive decomposition and construction for examination timetabling problems. In Multidisciplinary international scheduling: theory and applications (MISTA\u201907), Paris, France (pp. 418\u2013425)."},{"issue":"1","key":"999_CR41","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10951-008-0077-5","volume":"12","author":"R. Qu","year":"2009","unstructured":"Qu, R., Burke, E. K., Mccollum, B., Merlot, L. T., & Lee, S. Y. (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":"999_CR42","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 Operations Research, 63, 105\u2013128.","journal-title":"Annals of Operations Research"},{"key":"999_CR43","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":"Selected papers from the Practice and theory of automated timetabling 2006","author":"\u00d6. \u00dclker","year":"2007","unstructured":"\u00dclker, \u00d6., \u00d6zcan, E., & Korkmaz, E. E. (2007). Linear linkage encoding in grouping problems: applications on graph coloring and timetabling. In Lecture notes in computer science: Vol. 3867. Selected papers from the Practice and theory of automated timetabling 2006 (pp. 347\u2013363). Berlin: Springer."},{"key":"999_CR44","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. 2079. Practice and theory of automated timetabling III: selected papers from the 3rd international conference (pp. 85\u2013103). Berlin: Springer."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0999-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0999-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0999-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T10:45:14Z","timestamp":1560768314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0999-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,13]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["999"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0999-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,13]]}}}