{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:55:57Z","timestamp":1725573357544},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540307051"},{"type":"electronic","value":"9783540324218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11593577_15","type":"book-chapter","created":{"date-parts":[[2005,11,5]],"date-time":"2005-11-05T02:32:45Z","timestamp":1131157965000},"page":"247-269","source":"Crossref","is-referenced-by-count":26,"title":["A Novel Similarity Measure for Heuristic Selection in Examination Timetabling"],"prefix":"10.1007","author":[{"given":"Yong","family":"Yang","sequence":"first","affiliation":[]},{"given":"Sanja","family":"Petrovic","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","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.: A Time-Predefined Local Search Approach to Exam Timetabling Problems. IIE Trans. Oper. Eng. 36, 509\u2013528 (2004)","journal-title":"IIE Trans. Oper. Eng."},{"key":"15_CR2","unstructured":"Burke, E.K., Eckersley, A.J., McCollum, B., Petrovic, S., Qu, R.: Similarity Measures For Exam Timetabling Problems. In: Proc. 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, pp. 120\u2013136 (2003)"},{"key":"15_CR3","doi-asserted-by":"publisher","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.: Hybrid Graph Heuristics in a Hyper-Heuristic Approach to Exam Timetabling. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Next Wave in Computing, Optimization and Decision Technologies, pp. 79\u201392. Springer, Heidelberg (2005)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-61794-9_52","volume-title":"Practice and Theory of Automated Timetabling","author":"E.K. Burke","year":"1996","unstructured":"Burke, E.K., Elliman, D.G., Ford, P.H., Weare, R.F.: Examination Timetabling in British Universities\u2014A Survey. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol.\u00a01153, pp. 76\u201392. Springer, Heidelberg (1996)"},{"key":"15_CR5","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.: Hyper-Heuristics: An Emerging Direction in Modern Search Technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Meta-heuristics, ch.\u00a016, pp. 457\u2013474. Kluwer, Dordrecht (2003)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Kendall, G., Soubeiga, E.: A Tabu Search Hyper-heuristic for Timetabling and Rostering. J. Heuristics\u00a09, 451\u2013470 (2003)","journal-title":"J. Heuristics"},{"key":"15_CR7","first-page":"445","volume-title":"Handbook of Graph Theory","author":"E. Burke","year":"2004","unstructured":"Burke, E., Kingston, J., De Werra, D.: Applications to Timetabling. Section 5.6. In: Gross, J., Yellen, J. (eds.) Handbook of Graph Theory, pp. 445\u2013474. Chapman and Hall\/CRC Press, London (2004)"},{"key":"15_CR8","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, J.D.: Design of Memetic Algorithms for Scheduling and Timetabling Problems. In: Krasnogor, N., Hart, W., Smith, J. (eds.) Recent Advances in Memetic Algorithms and Related Search Technologies, pp. 289\u2013312. Springer, Heidelberg (2004)"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0950-7051(00)00057-5","volume":"13","author":"E.K. Burke","year":"2000","unstructured":"Burke, E.K., MacCarthy, B., Petrovic, S., Qu, R.: Structured Cases in CBR\u2014Re-using and Adapting Cases for Time-Tabling Problems. Knowledge-Based Syst.\u00a013, 159\u2013165 (2000)","journal-title":"Knowledge-Based Syst"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/978-3-540-45157-0_18","volume-title":"Practice and Theory of Automated Timetabling IV","author":"E. Burke","year":"2003","unstructured":"Burke, E., MacCarthy, B., Petrovic, S., Qu, R.: Knowledge Discovery in a Hyper-heuristic Using Case-Based Reasoning for Course Timetabling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 276\u2013287. Springer, Heidelberg (2003)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Burke, E.K., MacCarthy, B., Petrovic, S., Qu, R.: Multiple-Retrieval Case Based Reasoning for Course Timetabling Problems. J. Oper. Res. Soc. (2005) (accepted for publication)","DOI":"10.1057\/palgrave.jors.2601970"},{"key":"15_CR12","unstructured":"Burke, E.K., Meisels, A., Petrovic, S., Qu, R.: A Graph-Based Hyper Heuristic for Timetabling Problems. Eur. J. Oper. Res. (2005) (accepted for publication)"},{"key":"15_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":"Practice and Theory of Automated Timetabling","author":"E.K. Burke","year":"1996","unstructured":"Burke, E.K., Newall, J.P., Weare, R.F.: A Memetic Algorithm for University Exam Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol.\u00a01153, pp. 241\u2013250. Springer, Heidelberg (1996)"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-540-45157-0_13","volume-title":"Practice and Theory of Automated Timetabling IV","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Newall, J.P.: Enhancing Timetable Solutions with Local Search Methods. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 195\u2013206. Springer, Heidelberg (2003)"},{"key":"15_CR15","doi-asserted-by":"publisher","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.: Initialisation Strategies and Diversity in Evolutionary Timetabling. Evol. Comput.\u00a06, 81\u2013103 (1998)","journal-title":"Evol. Comput."},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/B:ANOR.0000030684.30824.08","volume":"129","author":"E.K. Burke","year":"2004","unstructured":"Burke, E.K., Newell, J.P.: Solving Examination Timetabling Problems Through Adaptation of Heuristic Orderings. Ann. Oper. Res.\u00a0129, 107\u2013134 (2004)","journal-title":"Ann. Oper. Res."},{"key":"15_CR17","first-page":"574","volume-title":"Proceedings of the International ICSC Symposium on Engineering of Intelligent Systems (University of La Laguna)","author":"E.K. Burke","year":"1998","unstructured":"Burke, E.K., Newell, J.P., Weare, R.F.: A Simple Heuristically Guided Search for the Timetable Problem. In: Proceedings of the International ICSC Symposium on Engineering of Intelligent Systems (University of La Laguna), pp. 574\u2013579. Academic, New York (1998)"},{"key":"15_CR18","doi-asserted-by":"publisher","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.: Recent Research Directions in Automated Timetabling. Eur. J. Oper. Res.\u00a0140, 266\u2013280 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Petrovic, S., Qu, R.: Case Based Heuristic Selection for Timetabling Problems. J. Scheduling (2006) (accepted for publication)","DOI":"10.1007\/s10951-006-6775-y"},{"key":"15_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"M.W. Carter","year":"1986","unstructured":"Carter, M.W.: A Survey of Practical Applications on Examination Timetabling. Oper. Res.\u00a034, 193\u2013202 (1986)","journal-title":"Oper. Res."},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","first-page":"3","volume-title":"Practice and Theory of Automated Timetabling","author":"M.W. Carter","year":"1996","unstructured":"Carter, M.W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol.\u00a01153, pp. 3\u201321. Springer, Heidelberg (1996)"},{"key":"15_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1287\/inte.24.3.109","volume":"24","author":"M.W. Carter","year":"1994","unstructured":"Carter, M.W., Laporte, G., Chinneck, J.W.: A General Examination Scheduling System. Interfaces\u00a024, 109\u2013120 (1994)","journal-title":"Interfaces"},{"key":"15_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.Y.: Examination Timetabling: Algorithmic Strategies and Applications. J. Oper. Res. Soc.\u00a047, 373\u2013383 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"15_CR24","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1057\/palgrave.jors.2601115","volume":"52","author":"M.W. Carter","year":"2001","unstructured":"Carter, M.W., Johnson, D.G.: Extended Clique Initialisation in Examination Timetabling. J. Oper. Res. Soc.\u00a052, 538\u2013544 (2001)","journal-title":"J. Oper. Res. Soc."},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-45157-0_15","volume-title":"Practice and Theory of Automated Timetabling IV","author":"S. Casey","year":"2003","unstructured":"Casey, S., Thompson, J.: GRASPing the Examination Scheduling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 232\u2013246. Springer, Heidelberg (2003)"},{"key":"15_CR26","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/0377-2217(95)00081-X","volume":"93","author":"P.S. Deng","year":"1996","unstructured":"Deng, P.S.: Using Case-Based Reasoning Approach to the Support of Ill-structured Decisions. Eur. J. Oper. Res.\u00a093, 511\u2013521 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44629-X_7","volume-title":"Practice and Theory of Automated Timetabling III","author":"L. Gaspero Di","year":"2001","unstructured":"Di Gaspero, L., Schaerf, A.: Tabu Search Techniques for Examination Timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 104\u2013117. Springer, Heidelberg (2001)"},{"key":"15_CR28","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G. Dueck","year":"1993","unstructured":"Dueck, G.: New Optimization Heuristics. J. Comput. Phys.\u00a0104, 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"key":"15_CR29","volume-title":"Computers and Intractability a Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability a Guide to the Theory of NP-completeness. Freeman, San Francisco (1977)"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02023002","volume":"41","author":"M. Gendreau","year":"1993","unstructured":"Gendreau, M., Soriano, P., Salvail, L.: Solving the Maximum Clique Problem Using a Tabu Search Approach. Ann. Oper. Res.\u00a041, 385\u2013403 (1993)","journal-title":"Ann. Oper. Res."},{"key":"15_CR31","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1057\/jors.1990.5","volume":"41","author":"D. Johnson","year":"1990","unstructured":"Johnson, D.: Timetabling University Examinations. J. Oper. Res. Soc.\u00a041, 39\u201347 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"15_CR32","volume-title":"Case-Based Reasoning","author":"J. Kolodner","year":"1993","unstructured":"Kolodner, J.: Case-Based Reasoning. Morgan Kaufmann, San Mateo (1993)"},{"key":"15_CR33","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/0305-0548(84)90036-4","volume":"11","author":"G. Laporte","year":"1984","unstructured":"Laporte, G., Desroches, S.: Examination Timetabling by Computer. Comput. Oper. Res.\u00a011, 351\u2013360 (1984)","journal-title":"Comput. Oper. Res."},{"key":"15_CR34","unstructured":"Leake, D.B.: CBR in Context: the Present and Future, Case-Based Reasoning: Experiences, Lessons, and Future Directions. AAAI Press\/MIT Press, Menlo Park (1996)"},{"key":"15_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-45157-0_14","volume-title":"Practice and Theory of Automated Timetabling IV","author":"L.T.G. Merlot","year":"2003","unstructured":"Merlot, L.T.G., Boland, N., Hughes, B.D., Stuckey, P.J.: A Hybrid Algorithm for the Examination Timetabling Problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 205\u2013232. Springer, Heidelberg (2003)"},{"key":"15_CR36","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0004-3702(94)00089-J","volume":"76","author":"K. Miyashita","year":"1995","unstructured":"Miyashita, K., Sycara, K.: CABINS: A Framework of Knowledge Acquisition and Iterative Revision for Schedule Improvement and Reactive Repair. Artif. Intell.\u00a076, 377\u2013426 (1995)","journal-title":"Artif. Intell."},{"key":"15_CR37","series-title":"Lecture Notes in Computer Science","first-page":"149","volume-title":"Practice and Theory of Automated Timetabling IV","author":"S. Petrovic","year":"2003","unstructured":"Petrovic, S., Beddoe, G.R., Berghe, G.V.: Storing and Adapting Repair Experiences in Employee Rostering. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 149\u2013166. Springer, Heidelberg (2003)"},{"key":"15_CR38","unstructured":"Petrovic, S., Burke, E.: Educational Timetabling. In: Leung, J. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch.\u00a045, pp. 45.1\u201345.23. Chapman and Hall\/CRC Press, London (2004)"},{"key":"15_CR39","first-page":"55","volume-title":"Proc. STarting Artificial Intelligence Researchers Symposium (France)","author":"S. Petrovic","year":"2002","unstructured":"Petrovic, S., Kendall, G., Yang, Y.: A Tabu Search Approach for Graph-Structured Case Retrieval. In: Proc. STarting Artificial Intelligence Researchers Symposium (France), pp. 55\u201364. IOS Press, Amsterdam (2002)"},{"key":"15_CR40","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/0-387-27744-7_14","volume-title":"Multidisciplinary Scheduling Theory and Applications","author":"S. Petrovic","year":"2005","unstructured":"Petrovic, S., Yang, Y., Dror, M.: Case-based Initialisation of Metaheuristics for Examination Timetabling. In: Kendall, G., Burke, E., Petrovic, S., Gendreau, M. (eds.) Multidisciplinary Scheduling Theory and Applications, pp. 289\u2013308. Springer, Berlin (2005)"},{"key":"15_CR41","unstructured":"Petrovic, S., Yang, Y., Dror, M.: Use of Case Based Reasonin. Solving Examination Timetabling Problems. Technical Report NOTTCS-TR-2004-6, University of Nottingham, UK (2004)"},{"key":"15_CR42","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/(SICI)1520-6750(200004)47:3<201::AID-NAV2>3.0.CO;2-L","volume":"47","author":"A. Schirmer","year":"2000","unstructured":"Schirmer, A.: Case-Based Reasoning and Improved Adaptive Search for Project Scheduling. Naval Res. Log.\u00a047, 201\u2013222 (2000)","journal-title":"Naval Res. Log."},{"key":"15_CR43","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1016\/S0925-5273(97)00141-2","volume":"56\/7","author":"G. Schmidt","year":"1998","unstructured":"Schmidt, G.: Case-Based Reasoning for Production Scheduling. Int. J. Product. Econ.\u00a056\/7, 537\u2013546 (1998)","journal-title":"Int. J. Product. Econ."},{"key":"15_CR44","unstructured":"Terashima-Mar\u00edn, H., Ross, P., Valenzuela-Rend\u00f3n, M.: Evolution of Constraint Satisfaction Strategies in Examination Timetabling. In: Proceedings of the Genetic and Evolutionary Conference, pp. 635\u2013642 (1999)"},{"key":"15_CR45","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02601641","volume":"63","author":"J.M. Thompson","year":"1996","unstructured":"Thompson, J.M., Dowsland, K.A.: Variants of Simulated Annealing for the Examination Timetabling Problem. Ann. Oper. Res.\u00a063, 105\u2013128 (1996)","journal-title":"Ann. Oper. Res."},{"key":"15_CR46","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D.J.A. Welsh","year":"1967","unstructured":"Welsh, D.J.A., Powell, M.B.: An Upper Bound on the Chromatic Number of a Graph and its Application to Timetabling Problems. Comput. J.\u00a010, 85\u201386 (1967)","journal-title":"Comput. J."},{"key":"15_CR47","doi-asserted-by":"publisher","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, X.: Using Tabu Search With Longer-Term Memory and Relaxation to Create Examination Timetables. Eur. J. Oper. Res.\u00a0153, 80\u201391 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"15_CR48","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L.A. Zadeh","year":"1965","unstructured":"Zadeh, L.A.: Fuzzy Sets. Inform. Control\u00a08, 338\u2013353 (1965)","journal-title":"Inform. Control"},{"issue":"9","key":"15_CR49","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0020-0255(75)90036-5","volume":"8","author":"L.A. Zadeh","year":"1975","unstructured":"Zadeh, L.A.: The Concept of a Linguistic Variable and its Application to Approximate Reasoning. Inform. Sci. 8(9), 199\u2013249, 43\u201380, respectively (1975)","journal-title":"Inform. Sci."}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling V"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11593577_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T04:43:09Z","timestamp":1683261789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593577_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540307051","9783540324218"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/11593577_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}