{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:05:28Z","timestamp":1761894328175},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2006,10,1]],"date-time":"2006-10-01T00:00:00Z","timestamp":1159660800000},"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":[[2006,10]]},"DOI":"10.1007\/s10951-006-8495-8","type":"journal-article","created":{"date-parts":[[2006,6,16]],"date-time":"2006-06-16T07:47:07Z","timestamp":1150444027000},"page":"403-432","source":"Crossref","is-referenced-by-count":92,"title":["An effective hybrid algorithm for university course timetabling"],"prefix":"10.1007","volume":"9","author":[{"given":"Marco","family":"Chiarandini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Birattari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Socha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivia","family":"Rossi-Doria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8495_CR1","unstructured":"Arntzen, H. and A. L\u00f8kketangen, \u201cA tabu search heuristic for a university timetabling problem,\u201d in Proceedings of the Fifth Metaheuristics International Conference, Kyoto, Japan (Aug. 2003)."},{"key":"8495_CR2","unstructured":"Birattari, M., The Problem of Tuning Metaheuristics, as seen from a Machine Learning Perspective. PhD thesis, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium (2004)."},{"key":"8495_CR3","unstructured":"Birattari, M., \u201cThe race package for R. Racing methods for the selection of the best,\u201d Technical Report TR\/IRIDIA\/2003-37, IRIDIA, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium (2003)."},{"key":"8495_CR4","unstructured":"Birattari, M., T. St\u00fctzle, L. Paquete, and K. Varrentrapp, \u201cA Racing algorithm for configuring metaheuristics,\u201d in W. B. Langdon, E. Cant\u00fa-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M.A. Potter, A.C. Schultz, J.F. Miller, E. Burke, and N. Jonoska (eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), pp. 11\u201318, New York, 2002. Morgan Kaufmann Publishers."},{"key":"8495_CR5","doi-asserted-by":"crossref","unstructured":"Burke, E. K., A. J. Eckersley, B. McCollum, S. Petrovic, and R. Qu., \u201cAnalysing similarity in examination timetabling,\u201d in E. K. Burke and M. Trick, Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling. 2004, pp. 557\u2013559.","DOI":"10.1007\/11593577"},{"key":"8495_CR6","unstructured":"Burke, E. K., C. Beyrouthy, J. D. Landa Silva, B. McCollum, and P. McMullan, \u201cSpaceMAP-applying meta-heuristics to real world space allocation problems in academic institutions,\u201d in E. K. Burke and M. Trick (eds.), Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling. 2004, pp. 441\u2013444."},{"key":"8495_CR7","doi-asserted-by":"crossref","unstructured":"Burke, E. K., D. G. Elliman, and R. F. Weare, \u201cSpecialised recombinative operators for timetabling problems,\u201d in AISB Workshop on Evolutionary Computing, Springer Verlag Notes in Computer Science Volume 993, pp. 75\u201385. Springer Verlag, Berlin, Germany (1995).","DOI":"10.1007\/3-540-60469-3_26"},{"issue":"6","key":"8495_CR8","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., G. Kendall, and E. Soubeiga, \u201cA tabu-search hyperheuristic for timetabling and rostering,\u201d Journal of Heuristics, 9(6), 451\u2013470 (2003).","journal-title":"Journal of Heuristics"},{"key":"8495_CR9","doi-asserted-by":"crossref","unstructured":"Burke, E. K., J. P. Newall, and R. F. Weare, \u201cA memetic algorithm for university exam timetabling,\u201d in E. K. Burke and P. Ross Practice and Theory of Automated Timetabling, Springer Lecture Notes in Computer Science Volume 1153, pp. 241\u2013250.","DOI":"10.1007\/3-540-61794-9_63"},{"key":"8495_CR10","doi-asserted-by":"crossref","unstructured":"Burke, E. K. and M. A. Trick (eds.), Practice and Theory of Automated Timetabling V, 5th International Conference, PATAT 2004, vol. 3616 of Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany (2005).","DOI":"10.1007\/11593577"},{"key":"8495_CR11","doi-asserted-by":"crossref","unstructured":"Burke, E. K., and M. Trick (eds.), Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling. PATAT 2004, Pittsburgh, PA (Aug. 2004).","DOI":"10.1007\/11593577"},{"key":"8495_CR12","doi-asserted-by":"crossref","unstructured":"Burke, E. K. and M. W. Carter (eds.), Practice and Theory of Automated Timetabling II, Second International Conference, PATAT 1997, vol. 1408 of Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany (1998).","DOI":"10.1007\/BFb0055877"},{"key":"8495_CR13","doi-asserted-by":"crossref","unstructured":"Burke, E. K. and P. de Causmaecker (eds.), Practice and Theory of Automated Timetabling IV, 4th International Conference, PATAT 2002, vol. 2740 of Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany (2003).","DOI":"10.1007\/b11828"},{"key":"8495_CR14","doi-asserted-by":"crossref","unstructured":"Burke, E. K. and P. Ross (eds.), Practice and Theory of Automated Timetabling, First International Conference, PATAT 1995, vol. 1153 of Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany, (1996).","DOI":"10.1007\/3-540-61794-9"},{"issue":"2","key":"8495_CR15","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. and S. Petrovic. \u201cRecent research directions in automated timetabling,\u201d European Journal of Operational Research, 140(2), 266\u2013280 (2002).","journal-title":"European Journal of Operational Research"},{"key":"8495_CR16","doi-asserted-by":"crossref","unstructured":"Burke, E. K. and W. Erben (eds.), Practice and Theory of Automated Timetabling III, Third International Conference, PATAT 2000, vol. 2079 of Lecture Notes in Computer Science. Springer Verlag, Berlin, Germany (2001).","DOI":"10.1007\/3-540-44629-X"},{"key":"8495_CR17","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Y. Bykov, and S. Petrovic, \u201cA multicriteria approach to examination timetabling,\u201d in E. K. Burke and W. Erben, Practice and Theory of Automated Timetabling, Springer Lecture Notes in Computer Science Volume 1153, pp. 118\u2013131.","DOI":"10.1007\/3-540-44629-X_8"},{"issue":"2","key":"8495_CR18","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2298\/YJOR0302139B","volume":"13","author":"E. K. Burke","year":"2003","unstructured":"Burke, E. K., Y. Bykov, J. Newall, and S. Petrovic, \u201cA time-predefined approach to course timetabling,\u201d Yugoslav Journal of Operations Research, 13(2), 139\u2013151 (2003).","journal-title":"Yugoslav Journal of Operations Research"},{"key":"8495_CR19","doi-asserted-by":"crossref","unstructured":"Carter, M. W. and G. Laporte, \u201cRecent developments in practical course timetabling,\u201d in E. K. Burke and M. W. Carter (eds.), Practice and Theory of Automated Timetabling, Springer Lecture Notes in Computer Science Volume 1408, pp. 3\u201319.","DOI":"10.1007\/BFb0055878"},{"key":"8495_CR20","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., G. Laporte, and S. Y. Lee, \u201cExamination timetabling: Algorithmic strategies and applications,\u201d Journal of the Operational Research Society, 47, 373\u2013383 (1996).","journal-title":"Journal of the Operational Research Society"},{"key":"8495_CR21","unstructured":"Chand, A., \u201cA constraint based generic model for representing complete university timetabling data,\u201d in E. K. Burke and M. A. Trick (eds.), Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling. 2004, pp. 125\u2013150."},{"key":"8495_CR22","unstructured":"Chiarandini, M. and T. St\u00fctzle, \u201cExperimental evaluation of course timetabling algorithms.\u201d Technical Report AIDA-02-05, Intellectics Group, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany (April 2002)."},{"key":"8495_CR23","unstructured":"Chiarandini, M., Stochastic Local Search Methods for Highly Constrained Combinatorial Optimisation Problems. PhD thesis, Computer Science Department, Darmstadt University of Technology, Darmstadt, Germany, (Aug. 2005)."},{"key":"8495_CR24","volume-title":"Empirical Methods for Artificial Intelligence","author":"P. R. Cohen","year":"1995","unstructured":"Cohen, P. R., Empirical Methods for Artificial Intelligence. MIT Press, Boston (1995)."},{"key":"8495_CR25","volume-title":"Practical Nonparametric Statistics","author":"W. J. Conover","year":"1999","unstructured":"Conover, W. J., Practical Nonparametric Statistics. 3rd edn, John Wiley & Sons, New York, NY, USA (1999).","edition":"3"},{"key":"8495_CR26","unstructured":"Culberson, J. C., \u201cIterated greedy graph coloring and the difficulty landscape,\u201d Technical Report 92-07, Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada (June 1992)."},{"key":"8495_CR27","doi-asserted-by":"crossref","unstructured":"Custers, N. P. De Causmaecker, P. Demeester, and G. V. Berghe, \u201cSemantic components for timetabling,\u201d in E. K. Burke and M. A. Trick (eds.), Practice and Theory of Automated Timetabling, Springer Lecture Notes in Computer Science Volume 3616, pp. 17\u201333.","DOI":"10.1007\/11593577_2"},{"issue":"2","key":"8495_CR28","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. De Werra","year":"1985","unstructured":"De Werra. D., \u201cAn introduction to timetabling,\u201d European Journal of Operational Research, 19(2), 151\u2013162 (1985).","journal-title":"European Journal of Operational Research"},{"key":"8495_CR29","unstructured":"den Besten, M. L. Simple Metaheuristics for Scheduling: An Empirical Investigation into the Application of Iterated Local Search to Deterministic Scheduling Problems with Tardiness Penalties. PhD thesis, Darmstadt University of Technology, Darmstadt, Germany, October (2004)."},{"key":"8495_CR30","first-page":"81","volume-title":"Optimization Software Class Libraries","author":"L. Di Gaspero","year":"2002","unstructured":"Di Gaspero, L. and A. Schaerf, \u201cWriting local search algorithms using EASYLOCAL++,\u201d in S. Vo\u00df and D.L. Woodruff, (eds.), Optimization Software Class Libraries, pp. 81\u2013154. Kluwer Academic Publishers, Boston, MA, USA (2002)."},{"key":"8495_CR31","first-page":"81","volume-title":"Optimization Software Class Libraries","author":"A. Fink","year":"2002","unstructured":"Fink, A. and S. Vo\u00df, \u201cA heuristic optimization framework,\u201d in S. Vo\u00df and D.L. Woodruff (eds.), Optimization Software Class Libraries, pp. 81\u2013154. Kluwer Academic Publishers, Boston, MA, USA (2002)."},{"key":"8495_CR32","unstructured":"Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of $${\\mathcal {NP}}$$ -Completeness. Freeman, San Francisco, CA, USA (1979)."},{"issue":"4","key":"8495_CR33","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz, A. and D. de Werra, \u201cUsing tabu search techniques for graph coloring,\u201d Computing, 39(4), 345\u2013351 (1987).","journal-title":"Computing"},{"issue":"1\u20132","key":"8495_CR34","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H. H. Hoos","year":"1999","unstructured":"Hoos, H. H. and T. St\u00fctzle, \u201cCharacterising the behaviour of stochastic local search,\u201d Artificial Intelligence, 112(1\u20132), 213\u2013232 (1999).","journal-title":"Artificial Intelligence"},{"key":"8495_CR35","unstructured":"Hoos, H. H., and T. St\u00fctzle, \u201cEvaluating Las Vegas algorithms\u2014Pitfalls and remedies,\u201d in G. F. Cooper and S. Moral (eds.), Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98), pp. 238\u2013245. Morgan Kaufmann Publishers, San Francisco, CA, USA (1998)."},{"issue":"3","key":"8495_CR36","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D. S. Johnson","year":"1991","unstructured":"Johnson, D. S., C. R. Aragon, L. A. McGeoch, and C. Schevon, \u201cOptimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning,\u201d Operations Research, 39(3), 378\u2013406 (1991).","journal-title":"Operations Research"},{"key":"8495_CR37","doi-asserted-by":"crossref","unstructured":"Kostuch, P., \u201cThe university course timetabling problem with a three-phase approach,\u201d in E. K. Burke and M. A. Trick, Practice and Theory of Automated Timetabling, Springer Lecture Notes in Computer Science Volume 3616, pp. 109\u2013125.","DOI":"10.1007\/11593577_7"},{"key":"8495_CR38","unstructured":"Kostuch, P., \u201cUniversity course timetabling,\u201d Transfer Thesis, Oxford University, England (2003)."},{"key":"8495_CR39","doi-asserted-by":"crossref","unstructured":"Kostuch, P. and K. Socha, \u201cHardness prediction for the university course timetabling problem,\u201d in J. Gottlieb and G. R. Raidl, (eds.), Evolutionary Computation in Combinatorial Optimization, Springer Lecture Notes in Computer Science Volume 3004, pp. 132\u2013141. Springer Verlag, Berlin, Germany (2004).","DOI":"10.1007\/978-3-540-24652-7_14"},{"key":"8495_CR40","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H. R. Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o, H. R., O. Martin, and T. St\u00fctzle, \u201cIterated local search,\u201d in F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics, 321\u2013353. Kluwer Academic Publishers, Norwell, MA, USA (2002)."},{"key":"8495_CR41","unstructured":"Morgenstern, C. and H. Shapiro, \u201cColoration neighborhood structures for general graph coloring,\u201d in Proceedings of the first Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 226\u2013235. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1990)."},{"key":"8495_CR42","unstructured":"Newall, J. P., Hybrid Methods for Automated Timetabling. PhD thesis, Department of Computer Science, University of Nottingham, UK, May (1999)."},{"key":"8495_CR43","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C. H. Papadimitriou","year":"1982","unstructured":"Papadimitriou, C. H. and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., Englewood Cliffs, NJ, 1982."},{"key":"8495_CR44","unstructured":"Post, G. and B. Veltman. \u201cHarmonious personnel scheduling,\u201d in E. K. Burke and M. A. Trick (eds.), Proceedings of the 5th International Conference on the Practice and Theory of Automated Timetabling. PATAT 2004, pp. 557\u2013559."},{"key":"8495_CR45","unstructured":"Risler, M., M. Chiarandini, L. Paquete, T. Schiavinotto, and T. St\u00fctzle, \u201cAn algorithm for the car sequencing problem of the ROADEF 2005 challenge,\u201d Technical Report AIDA-04-06, Intellectics Group, Computer Science Department, Darmstadt University of Technology (2004)."},{"key":"8495_CR46","unstructured":"Rossi-Doria, O. and B. Paeehter, \u201cAn hyperheuristic approach to course timetabling problem using evolutionary algorithm,\u201d Technical Report CC-00970503, Napier University, Edinburgh, Scotland (2003)."},{"key":"8495_CR47","unstructured":"Rossi-Doria, O., B. Paechter, C. Blum, K. Socha, and M. Samples, \u201cA local search for the timetabling problem.\u201d in E. Burke and P. Causmaecker (eds.), Proceedings of the 4th International Conference on the Practice and Theory of Automated Timetabling, PATAT 2002, pp. 124\u2013127 Gent, Belgium (August 2002)."},{"key":"8495_CR48","doi-asserted-by":"crossref","unstructured":"Rossi-Doria, O., M. Samples, M. Birattari, M. Chiarandini, M. Dorigo, L. Gambardella, J. Knowles, M. Manfrin, M. Mastrolilli, B. Paechter, L. Paquete, and T. St\u00fctzle, \u201cA comparison of the performance of different metaheuristics on the timetabling problem,\u201d in E. K. Burke and P. De Causmaecker, Practice and Theory of Automated Timetabling, Springer Lecture Notes in Computer Science Volume 2740, pp. 329\u2013351.","DOI":"10.1007\/978-3-540-45157-0_22"},{"issue":"2","key":"8495_CR49","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A., \u201cA survey of automated timetabling,\u201d Artificial Intelligence Review, 13(2), 87\u2013127 (1999).","journal-title":"Artificial Intelligence Review"},{"key":"8495_CR50","volume-title":"Algorithms","author":"R. Sedgewick","year":"1988","unstructured":"Sedgewick, R. Algorithms. 2nd edn., Addison-Wesley, Reading, MA, USA (1988).","edition":"2"},{"key":"8495_CR51","unstructured":"Setubal, J. C., \u201cSequential and parallel experimental results with bipartite matching algorithms,\u201d Technical Report EC-96-09, Institute of Computing, University of Campinas, Brasil (1996)."},{"key":"8495_CR52","unstructured":"Sheskin, D. J., Handbook of Parametric and Nonparametric Statistical Procedures. 2nd edn., Chapman & Hall (2000)."},{"key":"8495_CR53","doi-asserted-by":"crossref","unstructured":"Socha, K., \u201cThe influence of run-time limits on choosing ant system parameters,\u201d in Cantu-Paz et al. (eds), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2003), vol. 2723 of Lecture Notes in Computer Science, pp. 49\u201360. Springer Verlag, Berlin, Germany (July 2003).","DOI":"10.1007\/3-540-45105-6_5"},{"key":"8495_CR54","doi-asserted-by":"crossref","unstructured":"Socha, K., M. Sampels, and M. Manfrin, \u201cAnt algorithms for the university course timetabling problem with regard to the state-of-the-art,\u201d in G\u00fcnther R. Raidl, Jean-Arcady Meyer, Martin Middendorf, Stefano Cagnoni, Juan J. Romero Cardalda, David Corne, Jens Gottlieb, Agn\u00e8s Guillot, Emma Hart, Colin G. Johnson, and Elena Marchiori (eds.), Applications of Evolutionary Computing: Proceedings of Evo Workshops 2003, vol. 2611 of Lecture Notes in Computer Science, pp. 334\u2013345. Springer Verlag, Berlin, Germany (2003).","DOI":"10.1007\/3-540-36605-9_31"},{"key":"8495_CR55","unstructured":"Terashima-Mar\u00edn, H., P. Ross, and M. Valenzuela-Rend\u00f3n, \u201cEvolution of constraint satisfaction strategies in examination timetabling,\u201d in W. Banzhaf, J. M. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. J. Jakiela, and R. E. Smith (eds.), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-1999), pp. 635\u2013642. Morgan Kaufmann Publishers, San Francisco, CA, USA (1999)."},{"issue":"7\u20138","key":"8495_CR56","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. and K. Dowsland, \u201cA robust simulated annealing based examination timetabling system,\u201d Computers and Operations Research, 25(7\u20138), 637\u2013648 (1998).","journal-title":"Computers and Operations Research"},{"key":"8495_CR57","doi-asserted-by":"crossref","unstructured":"Wren, A.,\u201cScheduling, timetabling and rostering\u2014a special relationship?,\u201d In E. K. Burke and P. Ross (eds.), Practice and Theory of Automated Timetabling, Springer Lecture Notes in Computer Science Volume 1153, pp. 46\u201375 (1996).","DOI":"10.1007\/3-540-61794-9_51"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8495-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-8495-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-8495-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,15]],"date-time":"2020-04-15T14:27:11Z","timestamp":1586960831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-8495-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10]]},"references-count":57,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["8495"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-8495-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10]]}}}