{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,5]],"date-time":"2026-08-05T22:59:42Z","timestamp":1785970782751,"version":"3.56.0"},"reference-count":100,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T00:00:00Z","timestamp":1221868800000},"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,4]]},"DOI":"10.1007\/s10951-008-0085-5","type":"journal-article","created":{"date-parts":[[2008,9,19]],"date-time":"2008-09-19T15:29:15Z","timestamp":1221838155000},"page":"121-146","source":"Crossref","is-referenced-by-count":24,"title":["A multi-objective evolutionary algorithm for examination timetabling"],"prefix":"10.1007","volume":"12","author":[{"given":"C. Y.","family":"Cheong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"K. C.","family":"Tan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Veeravalli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,9,20]]},"reference":[{"issue":"2","key":"85_CR1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s00291-006-0034-7","volume":"29","author":"S. Abdullah","year":"2007","unstructured":"Abdullah, S., Ahmadi, S., Burke, E. K., & Dror, M. (2007a). Investigating Ahuja\u2013Orlin\u2019s large neighbourhood search approach for examination timetabling. OR Spectrum, 29(2), 351\u2013372.","journal-title":"OR Spectrum"},{"key":"85_CR2","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 the Operational Research Society, 58, 1494\u20131502.","journal-title":"Journal of the Operational Research Society"},{"key":"85_CR3","unstructured":"Ahmadi, S., Barrone, R., Cheng, P., Cowling, P., & McCollum,\u00a0B. (2003). Perturbation based variable neighbourhood search in heuristic space for examination timetabling problem. In Proceedings of multidisciplinary international scheduling: theory and applications, MISTA 2003, Nottingham, UK (pp.\u00a0155\u2013171)."},{"key":"85_CR4","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). Multiexchange neighbourhood search algorithm for capacitated minimum spanning tree problem. Mathematical Programming, 91, 71\u201397.","journal-title":"Mathematical Programming"},{"key":"85_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/11593577_19","volume-title":"Proceedings of the 5th international conference on the practice and theory of automated timetabling, PATAT 2004","author":"H. Asmuni","year":"2005","unstructured":"Asmuni, H., Burke, E. K., Garibaldi, J. M., & McCollum, B. (2005). Fuzzy multiple heuristic orderings for examination timetabling. 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, PATAT 2004, Pittsburg, PA, USA (pp.\u00a0334\u2013353). Berlin: Springer."},{"key":"85_CR6","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":"Proceedings of the 6th international conference on the practice and theory of automated timetabling, PATAT 2006","author":"H. Asmuni","year":"2007","unstructured":"Asmuni, H., Burke, E. K., Garibaldi, J. M., & McCollum, B. (2007). A novel fuzzy approach to evaluate the quality of examination timetabling. In E. K. Burke & H. Rudov\u00e1 (Eds.), Lecture notes in computer science: Vol.\u00a03867. Proceedings of the 6th international conference on the practice and theory of automated timetabling, PATAT 2006, Brno, Czech Republic (pp.\u00a0327\u2013346). Berlin: Springer."},{"key":"85_CR7","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 and Operations Research, 19, 353\u2013361.","journal-title":"Computers and Operations Research"},{"key":"85_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-61794-9_50","volume-title":"Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995","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. Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995, Edinburgh, Scotland (pp.\u00a022\u201345). Berlin: Springer."},{"key":"85_CR9","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":"Proceedings of the 6th international conference on the practice and theory of automated timetabling, 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 E. K. Burke &\u00a0H.\u00a0Rudov\u00e1 (Eds.), Lecture notes in computer science: Vol.\u00a03867. Proceedings of the 6th international conference on the practice and theory of automated timetabling, PATAT 2006, Brno, Czech Republic (pp.\u00a0394\u2013412). Berlin: Springer."},{"key":"85_CR10","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":"85_CR11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Brelaz","year":"1979","unstructured":"Brelaz, D. (1979). New methods to color the vertices of a graph. Communication of the ACM, 22(4), 251\u2013256.","journal-title":"Communication of the ACM"},{"key":"85_CR12","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":"85_CR13","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0055882","volume-title":"Proceedings of the 2nd international conference on the practice and theory of automated timetabling, PATAT 1997","author":"B. Bullnheimer","year":"1998","unstructured":"Bullnheimer, B. (1998). An examination scheduling model to maximize students study time. In E. K. Burke & M. W. Carter (Eds.), Lecture notes in computer science: Vol.\u00a01408. Proceedings of the 2nd international conference on the practice and theory of automated timetabling, PATAT 1997, Toronto, Canada (pp.\u00a078\u201391). Berlin: Springer."},{"key":"85_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-60469-3_26","volume-title":"Evolutionary Computing: AISB Workshop","author":"E. K. Burke","year":"1995","unstructured":"Burke, E. K., Elliman, D. G., Ford, P. H., & Weare, R. F. (1995). Specialised recombinative operators for the timetabling problem. In T. Fogarty (Ed.), Lecture notes in computer science: Vol.\u00a0993. Evolutionary Computing: AISB Workshop, Sheffield, UK (pp.\u00a075\u201385). Berlin: Springer."},{"key":"85_CR15","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-61794-9_63","volume-title":"Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995","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 E. K. Burke & P. Ross (Eds.), Lecture notes in computer science: Vol.\u00a01153. Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995, Edinburgh, Scotland (pp.\u00a0241\u2013250). Berlin: Springer."},{"key":"85_CR16","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-61794-9_52","volume-title":"Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995","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\u2014a survey. In E.\u00a0K. Burke & P. Ross (Eds.), Lecture notes in computer science: Vol.\u00a01153. Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995, Edinburgh, Scotland (pp.\u00a076\u201390). Berlin: Springer."},{"issue":"9","key":"85_CR17","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":"85_CR18","unstructured":"Burke, E. K., Newall, J. P., & Weare, R. F. (1998a). A simple heuristically guided search for the timetable problem. In E. Alpaydin &\u00a0C.\u00a0Fyte (Eds.), Proceedings of the international ICSC symposium on engineering of intelligent systems, EIS 1998, Spain (pp.\u00a0574\u2013579)."},{"issue":"1","key":"85_CR19","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). Initialization strategies and diversity in evolutionary timetabling. Evolutionary Computation, 6(1), 81\u2013103.","journal-title":"Evolutionary Computation"},{"issue":"1","key":"85_CR20","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":"85_CR21","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/3-540-44629-X_8","volume-title":"Proceedings of the 3rd international conference on the practice and theory of automated timetabling, PATAT 2000","author":"E. K. Burke","year":"2001","unstructured":"Burke, E. K., Bykov, Y., & Petrovic, S. (2001). A multicriteria approach to examination timetabling. In E. K. Burke & W. Erben (Eds.), Lecture notes in computer science: Vol.\u00a02079. Proceedings of the 3rd international conference on the practice and theory of automated timetabling, PATAT 2000, Konstanz, Germany (pp.\u00a0118\u2013131). Berlin: Springer."},{"issue":"2","key":"85_CR22","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":"85_CR23","unstructured":"Burke, E. K., Petrovic, S., & Qu, R. (2002). Case-based heuristic selection for examination timetabling. In Proceedings of the 4th Asia-Pacific conference on simulated evolution and learning, SEAL 2002, Singapore (pp.\u00a0277\u2013281)."},{"key":"85_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":"Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002","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. Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002, Gent, Belgium (pp.\u00a0195\u2013206). Berlin: Springer."},{"key":"85_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"},{"key":"85_CR26","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). New York: Springer."},{"key":"85_CR27","first-page":"445","volume-title":"Handbook of graph theory","author":"E. K. Burke","year":"2004","unstructured":"Burke, E. K., Kingston, J., & de Werra, D. (2004a). Applications to timetabling. In J. Gross & J. Yellen (Eds.), Handbook of graph theory (pp.\u00a0445\u2013474). London: Chapman Hall."},{"issue":"6","key":"85_CR28","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. (2004b). A time-predefined local search approach to exam timetabling problems. IIE Transactions, 36(6), 509\u2013528.","journal-title":"IIE Transactions"},{"key":"85_CR29","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/0-387-23529-9_6","volume-title":"The next wave in computing, optimization, 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. L. Golden, S. Raghavan, & E. A. Wasil (Eds.), The next wave in computing, optimization, and decision technologies (pp.\u00a079\u201391). New York: Springer."},{"key":"85_CR30","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 CSiT, University of Nottingham."},{"key":"85_CR31","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":"85_CR32","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 educational timetabling problems. European Journal of Operational Research, 176, 177\u2013192.","journal-title":"European Journal of Operational Research"},{"key":"85_CR33","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, WAE 2000","author":"M. Caramia","year":"2001","unstructured":"Caramia, M., Dell\u2019Olmo, P., & Italiano, G. F. (2001). New algorithms for examination timetabling. In S. N\u00e4her & D. Wagner (Eds.), Lecture notes in computer science: Vol.\u00a01982. Algorithm Engineering 4th International Workshop, WAE 2000, Saarbr\u00fccken, Germany (pp.\u00a0230\u2013241). Berlin: Springer."},{"issue":"2","key":"85_CR34","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":"85_CR35","series-title":"Lecture notes in computer science","first-page":"3","volume-title":"Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995","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. Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995, Edinburgh, Scotland (pp.\u00a03\u201321). Berlin: Springer."},{"issue":"3","key":"85_CR36","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. The Journal of the Operational Research Society, 47(3), pp.\u00a0373\u2013383.","journal-title":"The Journal of the Operational Research Society"},{"key":"85_CR37","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 partition initialization in examination timetabling. The Journal of the Operational Research Society, 52, 538\u2013544.","journal-title":"The Journal of the Operational Research Society"},{"key":"85_CR38","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":"Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002","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. Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002, Gent, Belgium (pp.\u00a0232\u2013244). Berlin: Springer."},{"key":"85_CR39","doi-asserted-by":"crossref","unstructured":"Chan, C. K., Gooi, H. B., & Lim, M. H. (2002). Co-evolutionary algorithm approach to a university timetable system. In Proceedings of the 2002 congress on evolutionary computation, CEC 2002, Honolulu, HI, USA (Vol.\u00a02, pp.\u00a01946\u20131951).","DOI":"10.1109\/CEC.2002.1004541"},{"key":"85_CR40","doi-asserted-by":"crossref","unstructured":"Cheong, C. Y., Tan, K. C., & Veeravalli, B. (2007). Solving the exam timetabling problem via a multi-objective evolutionary algorithm\u2014a more general approach. In Proceedings of the 2007 IEEE symposium on computational intelligence in scheduling, CI-Sched 2007, Honolulu, HI, USA (pp.\u00a0165\u2013172).","DOI":"10.1109\/SCIS.2007.367685"},{"key":"85_CR41","first-page":"274","volume-title":"Proceedings of the genetic and evolutionary computation conference, GECCO 2001","author":"C. A. Coello Coello","year":"2001","unstructured":"Coello Coello, C. A., & Pulido, G. T. (2001). Multiobjective optimization using a micro-genetic algorithm. In L. Spector, E. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, & E. K. Burke (Eds.), Proceedings of the genetic and evolutionary computation conference, GECCO 2001, San Francisco, CA, USA (pp.\u00a0274\u2013282). San Mateo: Morgan Kaufmann."},{"key":"85_CR42","series-title":"Lecture notes in computer science","first-page":"151","volume-title":"Proceedings of the 5th international conference on the practice and theory of automated timetabling, PATAT 2004","author":"P. C\u00f4t\u00e9","year":"2005","unstructured":"C\u00f4t\u00e9, P., Wong, T., & Sabourin, 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. Proceedings of the 5th international conference on the practice and theory of automated timetabling, PATAT 2004, Pittsburg, PA, USA (pp.\u00a0151\u2013168). Berlin: Springer."},{"key":"85_CR43","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BFb0055888","volume-title":"Proceedings of the 2nd international conference on the practice and theory of automated timetabling, PATAT 1997","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. Proceedings of the 2nd international conference on the practice and theory of automated timetabling, PATAT 1997, Toronto, Canada (pp.\u00a0169\u2013186). Berlin: Springer."},{"key":"85_CR44","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":"85_CR45","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-44629-X_7","volume-title":"Proceedings of the 3rd international conference on the practice and theory of automated timetabling, PATAT 2000","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. Proceedings of the 3rd international conference on the practice and theory of automated timetabling, PATAT 2000, Konstanz, Germany (pp.\u00a0104\u2013117). Berlin: Springer."},{"key":"85_CR46","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. R. J. Smith, I. H. Osman, C. R.J. Reeves, & G. D. Smith (Eds.), Modern heuristic search methods (pp.\u00a0155\u2013166). New York: Wiley."},{"key":"85_CR47","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 optimization for the examination scheduling problem. The Journal of Operational Research Society, 56, 426\u2013438.","journal-title":"The Journal of Operational Research Society"},{"key":"85_CR48","doi-asserted-by":"crossref","unstructured":"Dozier, G., Brown, J., & Bahler, D. (1994). Solving small and large scale constraint satisfaction problems using a heuristic-based microgenetic algorithm. In Proceedings of the 1st IEEE international conference on evolutionary computation, Piscataway, NJ, USA (Vol.\u00a01, pp.\u00a0306\u2013311).","DOI":"10.1109\/ICEC.1994.349934"},{"key":"85_CR49","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, RIVF 2004, Hanoi, Vietnam (pp.\u00a0205\u2013210)."},{"key":"85_CR50","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":"Proceedings of the 6th international conference on the practice and theory of automated timetabling, PATAT 2006","author":"M. Eley","year":"2007","unstructured":"Eley, M. (2007). Ant algorithms for the exam timetabling problem. In E. K. Burke & H. Rudov\u00e1 (Eds.), Lecture notes in computer science: Vol.\u00a03867. Proceedings of the 6th international conference on the practice and theory of automated timetabling, PATAT 2006, Brno, Czech Republic (pp.\u00a0364\u2013382). Berlin: Springer."},{"key":"85_CR51","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/3-540-44629-X_9","volume-title":"Proceedings of the 3rd international conference on the practice and theory of automated timetabling, PATAT 2000","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. Proceedings of the 3rd international conference on the practice and theory of automated timetabling, PATAT 2000, Konstanz, Germany (pp.\u00a0132\u2013156). Berlin: Springer."},{"key":"85_CR52","series-title":"Lecture notes in computer science","first-page":"487","volume-title":"Proceedings of the 5th international conference on the practice and theory of automated timetabling, PATAT 2004","author":"W. Erben","year":"2005","unstructured":"Erben, W., & Song, P. Y. (2005). A hybrid grouping genetic algorithm for examination timetabling. 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, PATAT 2004, Pittsburg, PA, USA (pp.\u00a0487\u2013490). Berlin: Springer."},{"key":"85_CR53","unstructured":"Fonseca, C. M. (1995). Multiobjective genetic algorithms with application to control engineering problems. Ph.D. thesis, Dept. Automatic Control and Systems Eng., University of Sheffield, Sheffield, UK."},{"key":"85_CR54","unstructured":"Gani, T. A., Khader, A. T., & Budiarto, R. (2004). Optimizing examination timetabling using a hybrid evolution strategies. In Proceedings of the 2nd international conference on autonomous robots and agents, Palmerston North, New Zealand (pp.\u00a0345\u2013349)."},{"key":"85_CR55","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40, 1276\u20131290.","journal-title":"Management Science"},{"key":"85_CR56","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D. E. Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison-Wesley."},{"key":"85_CR57","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., & Mladenovic, N. (2001). Variable neighbourhood search: principles and applications. European Journal of Operational Research, 130, 449\u2013467.","journal-title":"European Journal of Operational Research"},{"key":"85_CR58","series-title":"Logic programming series","volume-title":"Constraint satisfaction in logic programming","author":"P. V. Hentenryck","year":"1989","unstructured":"Hentenryck, P. V. (1989). Constraint satisfaction in logic programming. Logic programming series. Cambridge: MIT Press."},{"key":"85_CR59","unstructured":"Hussin, N. (2005). Tabu search based hyper-heuristic approaches for examination timetabling. Ph.D. thesis, Department of Computer Science, University of Nottingham."},{"issue":"3","key":"85_CR60","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1109\/4235.930311","volume":"5","author":"S. A. Kazarlis","year":"2001","unstructured":"Kazarlis, S. A., Papadakis, S. E., Theocharis, J. B., & Petridis, V. (2001). Microgenetic algorithms as generalized hill-climbing operators for GA optimization. IEEE Transactions on Evolutionary Computation, 5(3), 204\u2013217.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"85_CR61","unstructured":"Kendall, G., & Hussin, N. M. (2003). An Investigation of a tabu search based hyperheuristic for examination timetabling. In Proceedings of multidisciplinary international scheduling: theory and applications, MISTA 2003, Nottingham, UK (pp.\u00a0309\u2013328)."},{"key":"85_CR62","series-title":"Lecture notes in computer science","first-page":"199","volume-title":"Proceedings of the 5th international conference on the practice and theory of automated timetabling, PATAT 2004","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 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, PATAT 2004, Pittsburg, PA, USA (pp.\u00a0199\u2013218). Berlin: Springer."},{"issue":"3","key":"85_CR63","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1057\/jors.1991.42","volume":"42","author":"V. Lotfi","year":"1991","unstructured":"Lotfi, V., & Cerveny, R. (1991). A final exam-scheduling package. The Journal of the Operational Research Society, 42(3), 205\u2013216.","journal-title":"The Journal of the Operational Research Society"},{"key":"85_CR64","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":"Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002","author":"L. T. G. Merlot","year":"2003","unstructured":"Merlot, L. T. G., Boland N., Hughes, B. D., & Stuckey, P. J. (2003). A\u00a0hybrid algorithm for the examination timetabling problem. In E.\u00a0K.\u00a0Burke & P. De Causmaecker (Eds.), Lecture notes in computer science: Vol.\u00a02740. Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002, Gent, Belgium (pp.\u00a0207\u2013231). Berlin: Springer."},{"issue":"11","key":"85_CR65","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., & Hansen, P. (1997). Variable neighbourhood search. Computers and Operations Research, 24(11), 1097\u20131100.","journal-title":"Computers and Operations Research"},{"key":"85_CR66","volume-title":"Proceedings of the international conference on parallel computing and transputer applications","author":"P. Moscato","year":"1991","unstructured":"Moscato, P., & Norman, M. G. (1991). A \u2018memetic\u2019 approach for the travelling salesman problem\u2014implementation of computational ecology for combinatorial optimisation on message-passing systems. In Proceedings of the international conference on parallel computing and transputer applications. Amsterdam: IOS Press."},{"key":"85_CR67","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, 337\u2013354.","journal-title":"Applied Mathematics and Computation"},{"key":"85_CR68","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, 705\u2013733.","journal-title":"Applied Mathematics and Computation"},{"key":"85_CR69","unstructured":"Paquete, L. F., & Fonseca, C. M. (2001). A study of examination timetabling with multiobjective evolutionary algorithms. In Proceedings of the 4th metaheuristics international conference, MIC 2001, Porto, Portugal (pp.\u00a0149\u2013153)."},{"key":"85_CR70","series-title":"Lecture notes in computer science","first-page":"413","volume-title":"Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002","author":"L. F. Paquete","year":"2003","unstructured":"Paquete, L. F., & St\u00fctzle, T. (2003). Empirical analysis of tabu search for the lexicographic optimization of the examination timetabling problem. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science: Vol.\u00a02740. Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002, Gent, Belgium (pp.\u00a0413\u2013420). Berlin: Springer."},{"key":"85_CR71","series-title":"Lecture notes in computer science","first-page":"179","volume-title":"Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002","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.\u00a02740. Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002, Gent, Belgium (pp.\u00a0179\u2013192). Berlin: Springer."},{"key":"85_CR72","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 (Chap.\u00a045). London: Chapman & Hall."},{"key":"85_CR73","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/3-540-36970-8_18","volume-title":"2nd international conference on evolutionary multi-criterion optimization, EMO 2003","author":"G. T. Pulido","year":"2003","unstructured":"Pulido, G. T., & Coello Coello, C. A. (2003). The micro genetic algorithm 2: Towards online adaptation in evolutionary multiobjective optimization. In C. M. Fonseca, P. J. Fleming, E.\u00a0Zitzler, K. Deb, & L. Thiele (Eds.), Lecture notes in computer science: Vol.\u00a02632. 2nd international conference on evolutionary multi-criterion optimization, EMO 2003, Faro, Portugal (pp.\u00a0252\u2013266). Berlin: Springer."},{"key":"85_CR74","unstructured":"Qu, R., & Burke, E. K. (2005). Analysing high level heuristics within a graph-based hyper heuristic for exam timetabling problems (Technical Report NOTTCS-TR-2005-3). School of CSiT, University of Nottingham."},{"key":"85_CR75","unstructured":"Qu, R., & Burke, E. K. (to appear). Hybridisations within a graph based hyper-heuristic framework for university timetabling problems. Journal of the Operational Research Society."},{"key":"85_CR76","doi-asserted-by":"crossref","unstructured":"Qu, R., Burke, E. K., McCollum, B., Merlot, L. T. G., & Lee, S. Y. (to appear). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling.","DOI":"10.1007\/s10951-008-0077-5"},{"key":"85_CR77","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-58483-8_1","volume-title":"Evolutionary computing: AISB workshop","author":"N. J. Radcliffe","year":"1994","unstructured":"Radcliffe, N. J., & Surry, P. D. (1994). Formal memetic algorithms. In T. Fogarty (Ed.), Lecture notes in computer science: Vol.\u00a0865. Evolutionary computing: AISB workshop, Leeds, UK (pp.\u00a01\u201316). Berlin: Springer."},{"key":"85_CR78","volume-title":"Parallel problem solving in 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 Y.\u00a0Davidor, H.-P. Schwefel, & R. Manner (Eds.), Parallel problem solving in nature (Vol.\u00a0III). Berlin: Springer."},{"key":"85_CR79","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/3-540-61794-9_68","volume-title":"Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995","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. K. Burke & P. Ross (Eds.), Lecture notes in computer science: Vol.\u00a01153. Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995, Edinburgh, Scotland (pp.\u00a0309\u2013324). Berlin: Springer."},{"key":"85_CR80","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/BFb0055884","volume-title":"Proceedings of the 2nd international conference on the practice and theory of automated timetabling, PATAT 1997","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. Proceedings of the 2nd international conference on the practice and theory of automated timetabling, PATAT 1997, Toronto, Canada (pp.\u00a0115\u2013129). Berlin: Springer."},{"key":"85_CR81","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":"85_CR82","doi-asserted-by":"crossref","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, CEC 2004, Portland, OR, USA (Vol.\u00a02, pp.\u00a01691\u20131698).","DOI":"10.1109\/CEC.2004.1331099"},{"issue":"2","key":"85_CR83","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":"85_CR84","series-title":"Lecture notes in computer science","first-page":"387","volume-title":"Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002","author":"K. Sheibani","year":"2003","unstructured":"Sheibani, K. (2003). An evolutionary approach for the examination timetabling problems. In E. K. Burke & P. De Causmaecker (Eds.), Lecture notes in computer science: Vol.\u00a02740. Proceedings of the 4th international conference on the practice and theory of automated timetabling, PATAT 2002, Gent, Belgium (pp.\u00a0387\u2013396). Berlin: Springer."},{"key":"85_CR85","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1613\/jair.842","volume":"18","author":"K. C. Tan","year":"2004","unstructured":"Tan, K. C., Khor, E. F., Lee, T. H., & Sathikannan, R. (2004). An evolutionary algorithm with advanced goal and priority specification for multi-objective optimization. Journal of Artificial Intelligence Research, 18, 183\u2013215.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"85_CR86","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1016\/j.ejor.2005.12.029","volume":"177","author":"K. C. Tan","year":"2007","unstructured":"Tan, K. C., Cheong, C. Y., & Goh, C. K. (2007). Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. European Journal of Operational Research, 177, 813\u2013839.","journal-title":"European Journal of Operational Research"},{"key":"85_CR87","unstructured":"Terashima-Marin, H., Ross, P., & Valenzuela-Rendon, M. (1999a). Clique-based crossover for solving the timetabling problem with GAs. In Proceedings of the 1999 congress on evolutionary computation, CEC 1999, Washington, DC, USA (pp.\u00a01200\u20131206)."},{"key":"85_CR88","doi-asserted-by":"crossref","unstructured":"Terashima-Marin, H., Ross, P., & Valenzuela-Rendon, M. (1999b). Application of the hardness theory when solving the timetabling problem with GAs. In Proceedings of the 1999 congress on evolutionary computation, CEC 1999, Washington, DC, USA (pp.\u00a0604\u2013611).","DOI":"10.1109\/CEC.1999.781988"},{"key":"85_CR89","first-page":"635","volume-title":"Proceedings of the genetic and evolutionary computation conference, GECCO 1999","author":"H. Terashima-Marin","year":"1999","unstructured":"Terashima-Marin, H., Ross, P., & Valenzuela-Rendon, M. (1999c). Evolution of constraint satisfaction strategies in examination timetabling. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, & R. E. Smith (Eds.), Proceedings of the genetic and evolutionary computation conference, GECCO 1999, Orlando, Florida, USA (pp.\u00a0635\u2013642). San Mateo: Morgan Kaufmann."},{"key":"85_CR90","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/3-540-61794-9_70","volume-title":"Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995","author":"J. Thompson","year":"1996","unstructured":"Thompson, J., & Dowsland, K. (1996a). General cooling schedules for a simulated annealing timetabling system. In E. K. Burke &\u00a0P.\u00a0Ross (Eds.), Lecture notes in computer science: Vol.\u00a01153. Proceedings of the 1st international conference on the practice and theory of automated timetabling, PATAT 1995, Edinburgh, Scotland (pp.\u00a0345\u2013363). Berlin: Springer."},{"key":"85_CR91","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02601641","volume":"63","author":"J. Thompson","year":"1996","unstructured":"Thompson, J., & Dowsland, K. (1996b). Variants of simulated annealing for the examination timetabling problem. Annals of Operations Research, 63, 105\u2013128.","journal-title":"Annals of Operations Research"},{"key":"85_CR92","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 and Operations Research, 25, 637\u2013648.","journal-title":"Computers and Operations Research"},{"key":"85_CR93","first-page":"219","volume":"17","author":"G. M. White","year":"1979","unstructured":"White, G. M., & Chan, P. W. (1979). Towards the construction of optimal examination timetables. INFOR, 17, 219\u2013229.","journal-title":"INFOR"},{"key":"85_CR94","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/3-540-44629-X_6","volume-title":"Proceedings of the 3rd international conference on the practice and theory of automated timetabling, PATAT 2000","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. Proceedings of the 3rd international conference on the practice and theory of automated timetabling, PATAT 2000, Konstanz, Germany (pp.\u00a085\u2013103). Berlin: Springer."},{"issue":"16","key":"85_CR95","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":"85_CR96","unstructured":"Wolpert, D. H., & Macready, W. G. (1995). No free lunch theorems for search (Technical Report SFI-TR-95-02-010). Santa Fe Institute, Santa Fe, NM."},{"issue":"1","key":"85_CR97","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D. H. Wolpert","year":"1997","unstructured":"Wolpert, D. H., & Macready, W. G. (1997). No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67\u201382.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"85_CR98","doi-asserted-by":"crossref","unstructured":"Wong, T., C\u00f4t\u00e9, P., & Sabourin, R. (2004). A hybrid MOEA for the capacitated exam proximity problem. In Proceedings of the 2004 congress on evolutionary computation, CEC 2004, Portland, OR, USA (Vol.\u00a02, pp.\u00a01495\u20131501).","DOI":"10.1109\/CEC.2004.1331073"},{"issue":"1","key":"85_CR99","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":"85_CR100","series-title":"Lecture notes in computer science","first-page":"377","volume-title":"Proceedings of the 5th international conference on the practice and theory of automated timetabling, PATAT 2004","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 &\u00a0M.\u00a0Trick (Eds.), Lecture notes in computer science: Vol.\u00a03616. Proceedings of the 5th international conference on the practice and theory of automated timetabling, PATAT 2004, Pittsburg, PA, USA (pp.\u00a0377\u2013396). Berlin: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-008-0085-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-008-0085-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-0085-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:31:51Z","timestamp":1738369911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-008-0085-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9,20]]},"references-count":100,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["85"],"URL":"https:\/\/doi.org\/10.1007\/s10951-008-0085-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,9,20]]}}}