{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T16:13:15Z","timestamp":1778170395716,"version":"3.51.4"},"publisher-location":"Boston","reference-count":32,"publisher":"Kluwer Academic Publishers","isbn-type":[{"value":"1402072635","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-306-48056-5_16","type":"book-chapter","created":{"date-parts":[[2006,2,2]],"date-time":"2006-02-02T18:26:26Z","timestamp":1138904786000},"page":"457-474","source":"Crossref","is-referenced-by-count":422,"title":["Hyper-Heuristics: An Emerging Direction in Modern Search Technology"],"prefix":"10.1007","author":[{"given":"Edmund","family":"Burke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Graham","family":"Kendall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jim","family":"Newall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emma","family":"Hart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Ross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonia","family":"Schulenburg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"P. Ross, E. Hart and D. Corne (1997) Some observations about GA-based exam timetabling. In: E.K. Burke and M. Carter (eds.), LNCS 1408, Practice and Theory of Automated Timetabling II: Second International Conference, PATAT 1997, Toronto, Canada, selected papers. Springer-Verlag, pp. 115\u2013129."},{"key":"16_CR2","unstructured":"H.-L. Fang, P.M. Ross and D. Corne (1994) A promising hybrid GA\/heuristic approach for open-shop scheduling problems. In: A. Cohn (ed.), Proceedings of ECAI 94: 11th European Conference on Artificial Intelligence. John Wiley and Sons Ltd, pp. 590\u2013594."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"E.K. Burke, B.L. MacCarthy, S. Petrovic and R. Qu (2002) Knowledge discovery in a hyper-heuristic for course timetabling using case based reasoning. In: Proceedings of the Fourth International Conference on the Practice and Theory of Automated Timetabling (PATAT\u201902), Ghent, Belgium (to appear).","DOI":"10.1007\/978-3-540-45157-0_18"},{"key":"16_CR4","unstructured":"S. Petrovic and R. Qu (2002) Case-Based Reasoning as a Heuristic Selector in a Hyper-Heuristic for Course Timetabling. In: Proceedings of the Sixth International Conference on Knowledge-Based Intelligent Information & Engineering Systems (KES\u20192002), Crema, Italy (to appear)."},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D. Wolpert","year":"1997","unstructured":"D. Wolpert and W.G. MacReady (1997) No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation, 1(1), 67\u201382.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"16_CR6","volume-title":"Near-optimal Bin-packing Algorithms","author":"D.S. Johnson","year":"1973","unstructured":"D.S. Johnson (1973) Near-optimal Bin-packing Algorithms. Ph.D. thesis. MIT Department of Mathematics, Cambridge, MA."},{"key":"16_CR7","first-page":"46","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"E.G. Coffman","year":"1996","unstructured":"E.G. Coffman, M.R. Garey and D.S. Johnson (1996) Approximation algorithms for bin packing: a survey. In: D. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems. PWS Publishing, Boston, pp. 46\u201393."},{"key":"16_CR8","unstructured":"P.A. Djang and P.R. Finch. Solving one dimensional bin packing problems. Available as http:\/\/www.zianet.com\/pdjang\/binpack\/paper.zip ."},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1023\/A:1009678411503","volume":"3","author":"I.P. Gent","year":"1998","unstructured":"I.P. Gent (1998) Heuristic solution of open bin packing problems. Journal of Heuristics, 3(4), 299\u2013304.","journal-title":"Journal of Heuristics"},{"key":"16_CR10","unstructured":"L.S. Pitsoulis and M.G.C. Resende (2001) Greedy randomized adaptive search procedures. In: P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization. OUP, pp. 168\u2013181."},{"key":"16_CR11","unstructured":"S.E. Cross and E. Walker (1994) Dart: applying knowledge-based planning and scheduling to crisis action planning. In: M. Zweben and M.S. Fox (eds.), Intelligent Scheduling. Morgan Kaufmann."},{"key":"16_CR12","unstructured":"S. Minton (1998) Learning Search Control Knowledge: An Explanation-based Approach. Kluwer."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"J. Gratch, S. Chein and G. de Jong (1993) Learning search control knowledge for deep space network scheduling. In: Proceedings of the Tenth International Conference on Machine Learning. pp. 135\u2013142.","DOI":"10.1016\/B978-1-55860-307-3.50024-1"},{"key":"16_CR14","first-page":"110","volume-title":"First International Conference on Evolutionary Computing and its Applications (EvCA\u201996)","author":"J.D. Schaffer","year":"1996","unstructured":"J.D. Schaffer (1996) Combinatorial optimization by genetic algorithms: the value of the phenotype\/genotype distinction. In: E.D. Goodman, V.L. Uskov, W.F. Punch III (eds.), First International Conference on Evolutionary Computing and its Applications (EvCA\u201996), Russian Academy of Sciences, Moscow, Russia, June 24\u201327, Institute for High Performance Computer Systems of the Russian Academy of Sciences, Moscow, Russia, pp. 110\u2013120."},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"E. Hart and P.M. Ross (1998) A heuristic combination method for solving job-shop scheduling problems. In: A.E. Eiben, T. Back, M. Schoenauer and H.-P. Schwefel (eds.), Parallel Problem Solving from Nature V, LNCS 1498, Springer-Verlag, pp. 845\u2013854.","DOI":"10.1007\/BFb0056926"},{"issue":"4","key":"16_CR16","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.8.4.487","volume":"8","author":"B. Giffler","year":"1960","unstructured":"B. Giffler and G.L. Thompson (1960) Algorithms for solving production scheduling problems. Operations Research, 8(4), 487\u2013503.","journal-title":"Operations Research"},{"issue":"1","key":"16_CR17","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1162\/evco.1998.6.1.61","volume":"6","author":"E. Hart","year":"1998","unstructured":"E. Hart, P.M. Ross and J. Nelson (1998) Solving a real-world problem using an evolving heuristically driven schedule builder. Evolutionary Computation, 6(1), 61\u201380.","journal-title":"Evolutionary Computation"},{"key":"16_CR18","unstructured":"H. Terashima-Mar\u00edn, P.M. Ross and M. Valenzuela-Rend\u00f3n (1999) Evolution of constraint satisfaction strategies in examination timetabling. In: W. Banzhaf et al. (eds.), Proceedings of the GECCO-99 Genetic and Evolutionary Computation Conference. Morgan Kaufmann, pp. 635\u2013642."},{"key":"16_CR19","series-title":"Technical Report","volume-title":"Hyperheuristics: a robust optimisation method applied to nurse scheduling","author":"P. Cowling","year":"2002","unstructured":"P. Cowling, G. Kendall and E. Soubeiga (2002) Hyperheuristics: a robust optimisation method applied to nurse scheduling. Technical Report NOTTCS-TR-2002-6 (submitted to PPSN 2002 Conference), University of Nottingham, UK, School of Computer Science & IT."},{"key":"16_CR20","series-title":"Technical Report","volume-title":"An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem","author":"L. Han","year":"2002","unstructured":"L. Han, G. Kendall and P. Cowling (2002) An adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem. Technical Report NOTTCS-TR-2002-5 (submitted to SEAL 2002 Conference), University of Nottingham, UK, School of Computer Science & IT."},{"key":"16_CR21","unstructured":"P. Ross, S. Schulenburg, J.G. Mar\u00edn-Bl\u00e1zquez and E. Hart (2002) Hyperheuristics: learning to combine simple heuristics in bin-packing problems. Accepted for Genetic and Evolutionary Computation Conference (GECCO 20020) 2002, July 9\u201313, New York."},{"key":"16_CR22","unstructured":"S. Wilson (1998) Generalisation in the XCS classifier system. In: J. Koza (ed.), Proceedings of the Third Genetic Programming Conference. Morgan Kaufmann, pp. 665\u2013674."},{"key":"16_CR23","unstructured":"S. Schulenburg, P. Ross, J.G. Mar\u00edn-Bl\u00e1zquez and E. Hart. A hyper-heuristic approach to single and multiple step environments in bin-packing problems. Proceedings of the Fifth International Workshop on Learning Classifier Systems 2002 (IWLCS-02) (to appear)."},{"key":"16_CR24","unstructured":"http:\/\/bwl.tu-darmstadt.de\/bwl3\/forsch\/projekte\/binpp ."},{"key":"16_CR25","unstructured":"P. Cowling, G. Kendall, E. Soubeiga (2000) A hyperheuristic approach to scheduling a sales summit. In: E.K. Burke and W. Erben (eds.), LNCS2079, Practice and Theory of Automated Timetabling III: Third International Conference, PATAT 2000, Konstanz, Germany, August, selected papers, Springer-Verlag, pp. 176\u2013190."},{"key":"16_CR26","unstructured":"P. Cowling, G. Kendall and E. Soubeiga (2001) A parameter-free hyperheuristic for scheduling a sales summit. In: Proceedings of 4th Metahuristics International Conference (MIC 2001), Porto Portugal, 16\u201320 July, pp. 127\u2013131."},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"P. Cowling, G. Kendall and E. Soubeiga (2002) Hyperheuristics: a tool for rapid prototyping in scheduling and optimisation. In: S. Cagoni, J. Gottlieb, E. Hart, M. Middendorf and R. G\u00fcnther (eds.), LNCS 2279, Applications of Evolutionary Computing: Proceedings ofEvo Workshops 2002, Kinsale, Ireland, April 3\u20134, ISSN 0302-9743, ISBN 3-540-43432-1, Springer-Verlag, pp. 1\u201310.","DOI":"10.1007\/3-540-46004-7_1"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"P. Cowling, G. Kendal and L. Han (2002) An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of Congress on Evolutionary Computation (CEC2002), Hilton Hawaiian Village Hotel, Honolulu, Hawaii, May 12\u201317, pp. 1185\u20131190, ISBN 0-7803-7282-4.","DOI":"10.1109\/CEC.2002.1004411"},{"key":"16_CR29","series-title":"Technical Report","volume-title":"A new adaptive heuristic framework for examination timetabling problems","author":"E.K. Burke","year":"2002","unstructured":"E.K. Burke and J.P. Newall (2002) A new adaptive heuristic framework for examination timetabling problems. Technical Report NOTTCS-TR-2001-5 (submitted to Annals of Operations Research), University of Nottingham, UK, School of Computer Science & IT."},{"key":"16_CR30","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1613\/jair.561","volume":"10","author":"D.E. Joslin","year":"1999","unstructured":"D.E. Joslin and D.P. Clements (1999) Squeaky wheel optimization. Journal of Artificial Intelligence Research, 10, 353\u2013373.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"16_CR31","unstructured":"B. Selman and H. Kautz (1993) Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In: Proceedings of the 13th International Joint Conference on Artificial Intelligence, pp. 290\u2013295."},{"key":"16_CR32","doi-asserted-by":"crossref","unstructured":"E.K. Burke and S. Petrovic (2002) Recent Research Directions in Automated Timetabling. European Journal of Operational Research (to appear).","DOI":"10.1016\/S0377-2217(02)00069-3"}],"container-title":["International Series in Operations Research & Management Science","Handbook of Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-306-48056-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T04:20:19Z","timestamp":1619497219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-306-48056-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402072635"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/0-306-48056-5_16","relation":{},"subject":[]}}