{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T07:52:53Z","timestamp":1774770773740,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T00:00:00Z","timestamp":1267488000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10732-010-9128-0","type":"journal-article","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T17:43:12Z","timestamp":1267465392000},"page":"97-118","source":"Crossref","is-referenced-by-count":65,"title":["Neighborhood analysis: a case study on\u00a0curriculum-based course timetabling"],"prefix":"10.1007","volume":"17","author":[{"given":"Zhipeng","family":"L\u00fc","sequence":"first","affiliation":[]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,3,2]]},"reference":[{"key":"9128_CR1","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.: Solving examination timetabling problems through adaptation of heuristic orderings. Ann. Oper. Res. 129, 107\u2013134 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9128_CR2","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1057\/palgrave.jors.2601970","volume":"57","author":"E.K. Burke","year":"2006","unstructured":"Burke, E.K., MacCarthy, B.L., Petrovic, S., Qu, R.: Multiple-retrieval case-based reasoning for course timetabling problems. J. Oper. Res. Soc. 57(2), 148\u2013162 (2006)","journal-title":"J. Oper. Res. Soc."},{"key":"9128_CR3","series-title":"LNCS","first-page":"232","volume-title":"Proceedings of the 4th PATAT Conference","author":"S. Casey","year":"2003","unstructured":"Casey, S., Thompson, J.: Grasping the examination scheduling problem. In: Burke, E.K., Causmaecker, P.D. (eds.) Proceedings of the 4th PATAT Conference. LNCS, vol. 2740, pp. 232\u2013246. Springer, Berlin (2003)"},{"key":"9128_CR4","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10951-006-8495-8","volume":"9","author":"M. Chiarandini","year":"2006","unstructured":"Chiarandini, M., Birattari, M., Socha, K., Rossi-Doria, O.: An effective hybrid algorithm for university course timetabling. J. Sched. 9, 403\u2013432 (2006)","journal-title":"J. Sched."},{"key":"9128_CR5","series-title":"LNCS","first-page":"151","volume-title":"Proceedings of the 5th PATAT Conference","author":"P. C\u00f4t\u00e9","year":"2005","unstructured":"C\u00f4t\u00e9, P., Wong, T., Sabourin, R.: Application of a hybrid multi-objective evolutionary algorithm to the uncapacitated exam proximity problem. In: Burke, E.K., Trick, M. (eds.) Proceedings of the 5th PATAT Conference. LNCS, vol. 3616, pp. 151\u2013168. Springer, Berlin (2005)"},{"issue":"1","key":"9128_CR6","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L. Gaspero Di","year":"2006","unstructured":"Di Gaspero, L., Schaerf, A.: Neighborhood portfolio approach for local search applied to timetabling problems. J. Math. Model. Algorithms 5(1), 65\u201389 (2006)","journal-title":"J. Math. Model. Algorithms"},{"issue":"4","key":"9128_CR7","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","volume":"7","author":"F. Glover","year":"1995","unstructured":"Glover, F.: Tabu thresholding: Improved search by nonmonotonic trajectories. ORSA J. Comput. 7(4), 426\u2013442 (1995)","journal-title":"ORSA J. Comput."},{"key":"9128_CR8","first-page":"1","volume-title":"Interfaces in Computer Science and Operations Research","author":"F. Glover","year":"1996","unstructured":"Glover, F.: Tabu Search and adaptive memory programming\u2014advances, applications and challenges. In: Interfaces in Computer Science and Operations Research, pp. 1\u201375. Kluwer Academic, Dordrecht (1996)"},{"key":"9128_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Boston (1997)"},{"issue":"2","key":"9128_CR10","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0272-6963(84)90027-5","volume":"4","author":"F. Glover","year":"1984","unstructured":"Glover, F., McMillan, C., Glover, R.: A heuristic programming approach to the employee scheduling problem and some thoughts on managerial robots. J. Oper. Manag. 4(2), 113\u2013128 (1984)","journal-title":"J. Oper. Manag."},{"issue":"1","key":"9128_CR11","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/TCBB.2007.1065","volume":"5","author":"A. Go\u00ebfon","year":"2008","unstructured":"Go\u00ebfon, A., Richer, J.M., Hao, J.K.: Progressive tree neighborhood applied to the maximum parsimony problem. IEEE\/ACM Trans. Comput. Biol. Bioinform. 5(1), 136\u2013145 (2008)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"3","key":"9128_CR12","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9128_CR13","volume-title":"Stochastic Local Search: Foundations and Applications","author":"H.H. Hoos","year":"2004","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, Elsevier, San Francisco (2004)"},{"key":"9128_CR14","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1090\/dimacs\/059\/11","volume-title":"Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges","author":"D.S. Johnson","year":"2002","unstructured":"Johnson, D.S.: A theoretician\u2019s guide to the experimental analysis of algorithms. In: Goldwasser, M.H., Johnson, D.S., McGeoch, C.C. (eds.) Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, pp. 215\u2013250. American Mathematical Society, Providence (2002)"},{"issue":"1","key":"9128_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R. Lewis","year":"2008","unstructured":"Lewis, R.: A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum 30(1), 167\u2013190 (2008)","journal-title":"OR Spectrum"},{"key":"9128_CR16","first-page":"321","volume-title":"Handbook of Meta-heuristics","author":"H.R. Lourenco","year":"2003","unstructured":"Lourenco, H.R., Martin, O., St\u00fctzle, T.: Iterated local search. In: Handbook of Meta-heuristics, pp. 321\u2013353. Springer, Berlin (2003)"},{"key":"9128_CR17","series-title":"LNCS","first-page":"1","volume-title":"EvoCop 2009","author":"Z. L\u00fc","year":"2009","unstructured":"L\u00fc, Z., Hao, J.K.: A critical element-guided perturbation strategy for iterated local search. In: Cotta, C., Cowling, P. (eds.) EvoCop 2009. LNCS, vol. 5482, pp. 1\u201312. Springer, Berlin (2009)"},{"issue":"1","key":"9128_CR18","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","volume":"200","author":"Z. L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Hao, J.K.: Adaptive tabu search for course timetabling. Eur. J. Oper. Res. 200(1), 235\u2013244 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9128_CR19","series-title":"LNCS","first-page":"3","volume-title":"Proceedings of the 6th PATAT Conference","author":"B. McCollum","year":"2007","unstructured":"McCollum, B.: A perspective on bridging the gap between research and practice in university timetabling. In: Burke, E.K., Rudova, H. (eds.) Proceedings of the 6th PATAT Conference. LNCS, vol. 3867, pp. 3\u201323. Springer, Berlin (2007)"},{"key":"9128_CR20","unstructured":"McCollum, B., McMullan, P., Paechter, B., Lewis, R., Schaerf, A., Di Gaspero, L., Parkes, A.J., Qu, R., Burke, E.K.: Setting the research agenda in automated timetabling: the second international timetabling competition. Technical Report http:\/\/www.cs.qub.ac.uk\/itc2007\/ITC2007_Background_Techreportv1.pdf (2008)"},{"key":"9128_CR21","series-title":"LNCS","first-page":"207","volume-title":"Proceedings of the 4th PATAT Conference","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., Causmaecker, P.D. (eds.) Proceedings of the 4th PATAT Conference. LNCS, vol. 2740, pp. 207\u2013231. Springer, Berlin (2003)"},{"issue":"11","key":"9128_CR22","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mlandenovic","year":"1997","unstructured":"Mlandenovic, N., Hansen, P.: Variable neighbourhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9128_CR23","unstructured":"M\u00fcller, T.: Solver description: a hybrid approach. In: Burke, E.K., Gendreau, M. (eds.) Proceedings of the 7th PATAT Conference. http:\/\/www.unitime.org\/papers\/itc2007.pdf (2008)"},{"key":"9128_CR24","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, Mineola (1998)"},{"key":"9128_CR25","unstructured":"Rossi-Doria, O., Paechter, B., Blum, C., Socha, K., Samples, M.: A local search for the timetabling problem. In: Burke, E.K., Causmaecker, P.D. (eds.) Proceedings of the 4th PATAT Conference. Gent, Belgium (2002)"},{"issue":"2","key":"9128_CR26","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A.: A survey of automated timetabling. Artif. Intell. Review 13(2), 87\u2013127 (1999)","journal-title":"Artif. Intell. Review"},{"issue":"2","key":"9128_CR27","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0004-3702(01)00151-5","volume":"132","author":"D. Schuurmans","year":"2001","unstructured":"Schuurmans, D., Southey, F.: Local search characteristics of incomplete sat procedures. Artif. Intell. 132(2), 121\u2013150 (2001)","journal-title":"Artif. Intell."},{"key":"9128_CR28","volume-title":"Algorithms","author":"R. Sedgewick","year":"1988","unstructured":"Sedgewick, R.: Algorithms, 2nd edn. Addison-Wesley, Reading (1988)","edition":"2"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9128-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9128-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9128-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:31Z","timestamp":1559242471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9128-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,3,2]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9128"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9128-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,3,2]]}}}