{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:53:17Z","timestamp":1761807197228,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"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_4","type":"book-chapter","created":{"date-parts":[[2005,11,5]],"date-time":"2005-11-05T07:32:45Z","timestamp":1131175965000},"page":"51-67","source":"Crossref","is-referenced-by-count":24,"title":["Distributed Choice Function Hyper-heuristics for Timetabling and Scheduling"],"prefix":"10.1007","author":[{"given":"Prapa","family":"Rattadilok","sequence":"first","affiliation":[]},{"given":"Andy","family":"Gaw","sequence":"additional","affiliation":[]},{"given":"Raymond S. K.","family":"Kwan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","volume":"37","author":"D. Abramson","year":"1991","unstructured":"Abramson, D.: Constructing School Timetables using Simulated Annealing: Sequential and Parallel Algorithms. Manage. Sci.\u00a037, 98\u2013113 (1991)","journal-title":"Manage. Sci."},{"key":"4_CR2","unstructured":"Abramson, D., Abela, J.: A Parallel Genetic Algorithm for Solving the School Timetabling Problem. In: Proc. 15th Australian Computer Science Conference (ACSC-15), vol.\u00a014, pp. 1\u201311 (1992)"},{"key":"4_CR3","unstructured":"Ayob, M., Kendall, G.: A Monte Carlo Hyper-heuristic To Optimise Component Placement Sequencing For Multi Head Placement Machine. In: Proc. Int. Conf. on Intelligent Technologies (InTech 2003), Chiang Mai, Thailand, December 17\u201319, pp. 132\u2013141 (2003)"},{"key":"4_CR4","series-title":"Applied Optimization Series","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-1-4613-3279-4_6","volume-title":"High Performance Algorithms and Software in Nonlinear Optimization","author":"B. Bullnheimer","year":"1998","unstructured":"Bullnheimer, B., Kotsis, G., Strauss, C.: Parallelization Strategies for the Ant System. In: High Performance Algorithms and Software in Nonlinear Optimization. Applied Optimization Series, vol.\u00a024, pp. 87\u2013100. Kluwer, Dordrecht (1998)"},{"key":"4_CR5","first-page":"79","volume-title":"The Next Wave in Computing, Optimization, and Decision Technologies. Conference Volume of the 9th INFORMS Computing Society Conference","author":"E.K. Burke","year":"2005","unstructured":"Burke, E.K., Dror, M., Petrovic, S., Qu, R.: Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems. In: Golden, B.L., Raghavan, S., Wasil, E.A. (eds.) The Next Wave in Computing, Optimization, and Decision Technologies. Conference Volume of the 9th INFORMS Computing Society Conference, pp. 79\u201391. Springer, Berlin (2005)"},{"key":"4_CR6","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":"4_CR7","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":"4_CR8","volume-title":"Meta-heuristics: Progress as Real Problem Solvers","author":"E.K. Burke","year":"2005","unstructured":"Burke, E.K., Landa Silva, J.D., Soubeiga, E.: Multi-objective Hyper-heuristic Approaches for Space Allocation and Timetabling. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Meta-heuristics: Progress as Real Problem Solvers. Springer, Berlin (2005) (to appear)"},{"key":"4_CR9","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.K. Burke","year":"2003","unstructured":"Burke, E.K., MacCarthy, B.L., Petrovic, S., Qu, R.: Knowledge Discovery in Hyper-heuristic Using Case-based Reasoning on Course Timetabling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 276\u2013287. Springer, Heidelberg (2003)"},{"key":"4_CR10","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":"4_CR11","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., Newall, J.P.: Solving Examination Timetabling Problems through Adaption of Heuristic Orderings. Ann. Oper. Res.\u00a0129, 107\u2013134 (2004)","journal-title":"Ann. Oper. Res."},{"key":"4_CR12","first-page":"141","volume":"10","author":"E. Cantu-Paz","year":"1998","unstructured":"Cantu-Paz, E.: A Survey of Parallel Genetic Algorithms. Calculateurs Paralleles, Reseaux Syst. Repartis\u00a010, 141\u2013171 (1998)","journal-title":"Calculateurs Paralleles, Reseaux Syst. Repartis"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Cowling, P., Kendall, G., Han, L.: An Investigation of a Hyperheuristic Genetic Algorithm Applied to a Trainer Scheduling Problem. In: Proc. Congress on Evolutionary Computation, CEC 2002, Honolulu, Hawaii, May 12\u201317, pp. 1185\u20131190 (2002)","DOI":"10.1109\/CEC.2002.1004411"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P. Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A Hyperheuristic Approach to Scheduling a Sales Summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 176\u2013190. Springer, Heidelberg (2001)"},{"key":"4_CR15","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A Parameter-Free Hyperheuristic for Scheduling a Sales Summit. In: Proc. 4th Metaheuristics Int. Conf., MIC 2001, Porto, Portugal, pp. 127\u2013131 (2001)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46004-7_1","volume-title":"Applications of Evolutionary Computing","author":"P. Cowling","year":"2002","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: Hyperheuristics: A Tool for Rapid Prototyping in Scheduling and Optimisation. In: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol.\u00a02279, pp. 1\u201310. Springer, Heidelberg (2002)"},{"key":"4_CR17","unstructured":"De Falco, I., Del Balio, R., Tarantino, E.: Solving the Mapping Problem by Parallel Tabu Search. Technical Report. Instituto per la Ricerca sui Sistemi Informatici Paralli, Italy (1996)"},{"key":"4_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1007\/978-3-540-24581-0_69","volume-title":"AI 2003: Advances in Artificial Intelligence","author":"L. Han","year":"2003","unstructured":"Han, L., Kendall, G.: Guided Operators for a Hyper-Heuristic Genetic Algorithm. In: Gedeon, T(T.) D., Fung, L.C.C. (eds.) AI 2003. LNCS (LNAI), vol.\u00a02903, pp. 807\u2013820. Springer, Heidelberg (2003)"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Han, L., Kendall, G.: Investigation of a Tabu Assisted Hyper-Heuristic Genetic Algorithm. In: Proc. Congress on Evolutionary Computation, CEC 2003, Canberra, Australia, vol.\u00a03, pp. 2230\u20132237 (2003)","DOI":"10.1109\/CEC.2003.1299949"},{"key":"4_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/0-387-27744-7_15","volume-title":"Multi-disciplinary Scheduling: Theory and Applications I (MISTA 2003) Selected Papers","author":"G. Kendall","year":"2005","unstructured":"Kendall, G., Mohd Hussin, N.: An Investigation of a Tabu Search Based Hyper-heuristic for Examination Timetabling. In: Kendall, G., Burke, E., Petrovic, S., Gendreau, M. (eds.) Multi-disciplinary Scheduling: Theory and Applications I (MISTA 2003) Selected Papers, pp. 309\u2013328. Springer, Berlin (2005)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/11593577_16","volume-title":"Practice and Theory of Automated Timetabling V","author":"G. Kendall","year":"2005","unstructured":"Kendall, G., Mohd Hussin, N.: Tabu Search Hyper-heuristic Approach to the Examination Timetabling Problem at the MARA University of Technology. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 270\u2013293. Springer, Heidelberg (2005)"},{"key":"4_CR22","unstructured":"Petrovic, S., Qu, R.: Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling Problems. In: Proc. Knowledge-Based Intelligent Information Engineering Systems and Allied Technologies, vol.\u00a082, pp. 336\u2013340 (2002)"},{"key":"4_CR23","unstructured":"Randall, M., Abramson, D.: A General Parallel Tabu Search Algorithm for Combinatorial Optimisation Problems. In: Proc. 1999 Parallel and Real Time Conference, Melbourne, Australia, pp. 68\u201379 (1999)"},{"key":"4_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1007\/3-540-45110-2_5","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"P. Ross","year":"2003","unstructured":"Ross, P., Mar\u00edn-Bl\u00e1zquez, J.G., Schulenburg, S., Hart, E.: Learning a Procedure That Can Solve Hard Bin-Packing Problems: A New GA-Based Approach to Hyper-heuristics. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1295\u20131306. Springer, Heidelberg (2003)"},{"key":"4_CR25","unstructured":"Ross, P., Schulenburg, S., Mar\u00edn-Bl\u00e1zquez, J.G., Hart, E.: Hyper-heuristics: Learning to Combine Simple Heuristics in Bin-Packing Problems. In: Proc. of the Genetic and Evolutionary Computation Conference (GECCO 2002), New York, pp. 942\u2013948 (2000)"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45724-0_1","volume-title":"Ant Algorithms","author":"K. Socha","year":"2002","unstructured":"Socha, K., Knowles, J., Sampels, M.: A Max\u2013Min Ant System for the University Course Timetabling Problem. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, pp. 1\u201313. Springer, Heidelberg (2002) (Also Technical Report TR\/IRIDIA\/2002-18)"},{"key":"4_CR27","unstructured":"Soubeiga, E.: Development and Application of Hyperheuristics to Personnel Scheduling, Ph.D Thesis. University of Nottingham (2003)"},{"key":"4_CR28","first-page":"635","volume-title":"Proc. Genetic and Evolutionary Computation Conference (GECCO 1999)","author":"H. Terashima-Marin","year":"1999","unstructured":"Terashima-Marin, H., Ross, P.M., Valenzuela-Rendon, M.: Evolution of Constraint Satisfaction Strategies in Examination Timetabling. In: Banzhaf, W., et al. (eds.) Proc. Genetic and Evolutionary Computation Conference (GECCO 1999), pp. 635\u2013642. Morgan Kaufmann, San Mateo (1999)"},{"key":"4_CR29","unstructured":"http:\/\/www.leeds.ac.uk\/iss\/wrgrid\/"},{"key":"4_CR30","unstructured":"http:\/\/www.idsia.ch\/Files\/ttcomp2002\/"}],"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_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T10:11:21Z","timestamp":1736071881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593577_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540307051","9783540324218"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/11593577_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}