{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:08:28Z","timestamp":1761894508275},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540485827"},{"type":"electronic","value":"9783540485841"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-48584-1_20","type":"book-chapter","created":{"date-parts":[[2007,4,24]],"date-time":"2007-04-24T16:35:52Z","timestamp":1177432552000},"page":"543-576","source":"Crossref","is-referenced-by-count":5,"title":["Using a Large Set of Low Level Heuristics in a Hyperheuristic Approach to Personnel Scheduling"],"prefix":"10.1007","author":[{"given":"Peter I.","family":"Cowling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantin","family":"Chakhlevitch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1_20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<139::AID-JOS41>3.0.CO;2-2","volume":"3","author":"U Aickelin","year":"2000","unstructured":"U. Aickelin and K. Dowsland (2000). \u201cExploiting problem structure in a genetic algorithm approach to a nurse rostering problem,\u201d Journal of Scheduling 3, 139-153.","journal-title":"Journal of Scheduling"},{"key":"20_CR2_20","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E Burke","year":"2001","unstructured":"E. Burke, P. Cowling, P. De Causmaecker, and G. Vanden Berghe (2001). \u201cA memetic approach to the nurse rostering problem,\u201d Applied Intelligence 15, 199-214.","journal-title":"Applied Intelligence"},{"key":"20_CR3_20","unstructured":"E. Burke, G. Kendall, J. Newall, E. Hart, P. Ross, and S. Schulenburg (2003). \u201cHyperheuristics: an emerging direction in modern search technology.\u201d In F. Glover and G. A. Kochenberger (eds.), Handbook of Metaheuristics. Kluwer Academic Publishers, 457-474."},{"key":"20_CR4_20","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E Burke","year":"2003","unstructured":"E. Burke, G. Kendall, and E. Soubeiga (2003). \u201cA tabu-search hyperheuristic for timetabling and rostering,\u201d Journal of Heuristics 9, 451-470.","journal-title":"Journal of Heuristics"},{"key":"20_CR5_20","unstructured":"D. Corne and P. Ross (1995). \u201cPeckish initialisation strategies for evolutionary timetabling.\u201d In E. Burke and P. Ross (eds.), Practice and Theory of Automated Timetabling. Springer Lecture Notes in Computer Science 1153, Springer, 227-240."},{"key":"20_CR6_20","doi-asserted-by":"crossref","unstructured":"P. Cowling, G. Kendall, and L. Han (2002). \u201cAn investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem.\u201d In Proceedings of 2002 Congress on Evolutionary Computation (CEC2002), IEEE Computer Society Press, Honolulu, USA, 1185-1190.","DOI":"10.1109\/CEC.2002.1004411"},{"key":"20_CR7_20","unstructured":"P. Cowling, G. Kendall, and E. Soubeiga (2000). \u201cA Hyperheuristic Approach to Scheduling a Sales Summit.\u201d In E. Burke and W. Erben (eds.), Practice and Theory of Automated Timetabling III: PATAT 2000. Springer Lecture Notes in Computer Science 2079, Springer, 176-190."},{"key":"20_CR8_20","unstructured":"P. Cowling, G. Kendall, and E. Soubeiga (2001). \u201cA parameter-free hyperheuristic for scheduling a sales summit.\u201d In Proceedings of the Third Metaheuristic International Conference (MIC\u20192001), Porto, Portugal, 127-131."},{"key":"20_CR9_20","doi-asserted-by":"crossref","unstructured":"P. Cowling, G. Kendall, and E. Soubeiga (2002). \u201cHyperheuristics: a tool for rapid prototyping in scheduling and optimisation.\u201d In S. Cagoni, J. Gottlieb, E. Hart, M. Middendorf and G. Raidl (eds.), Applications of Evolutionary Computing: Proceedings of Evo Workshops 2002. Springer Lecture Notes in Computer Science 2279, Springer, 1-10.","DOI":"10.1007\/3-540-46004-7_1"},{"key":"20_CR10_20","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/S0377-2217(97)00280-4","volume":"106","author":"B Dodin","year":"1998","unstructured":"B. Dodin, A. A. Elimam, and E. Rolland (1998). \u201cTabu search in audit scheduling,\u201d European Journal of Operational Research 106, 373-392.","journal-title":"European Journal of Operational Research"},{"key":"20_CR11_20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"K Dowsland","year":"1998","unstructured":"K. Dowsland (1998). \u201cNurse scheduling with tabu search and strategic oscillation,\u201d European Journal of Operational Research 106, 393-407.","journal-title":"European Journal of Operational Research"},{"key":"20_CR12_20","unstructured":"H.-L. Fang, P. Ross, and D. Corne (1994). \u201cA promising hybrid GA\/heuristic approach for open-shop scheduling problems.\u201d In A. Cohn (ed.), Proceedings of ECAI 94: 11th European Conference on Artificial Intelligence. John Wiley & Sons, 590-594."},{"key":"20_CR13_20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"F. Glover and M. Laguna (1997). Tabu Search. Kluwer Academic Publishers, Norwell, MA."},{"key":"20_CR14_20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1613\/jair.177","volume":"4","author":"J Gratch","year":"1996","unstructured":"J. Gratch and S. Chien (1996). \u201cAdaptive problem-solving for large-scale scheduling problems: a case study,\u201d Journal of Artificial Intelligence Research 4, 365-396.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"20_CR15_20","unstructured":"L. Han, G. Kendall, and P. Cowling (2002). \u201cAn adaptive length chromosome hyperheuristic genetic algorithm for a trainer scheduling problem.\u201d In Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL\u201902), Singapore, 267-271."},{"key":"20_CR16_20","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"P. Hansen and N. Mladenovi\u00fc (2001). \u201cVariable neighbourhood search: Principles and applications,\u201d European Journal of Operational Research 130, 449-467.","journal-title":"European Journal of Operational Research"},{"key":"20_CR17_20","doi-asserted-by":"crossref","unstructured":"E. Hart and P. Ross. (1998). \u201cA heuristic combination method for solving job-shop scheduling problems.\u201d In A.E. Eiben, T. Back, M. Schoenauer, H-P.Schwefel (eds), Parallel Problem Solving from Nature V. Springer Lecture Notes in Computer Science 1498, Springer, 845-854.","DOI":"10.1007\/BFb0056926"},{"key":"20_CR18_20","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1162\/evco.1998.6.1.61","volume":"6","author":"E Hart","year":"1998","unstructured":"E. Hart, P. Ross, and J. Nelson (1998). \u201cSolving a real-world problem using an evolving heuristically driven schedule builder,\u201d Evolutionary Computation 6, 61-80.","journal-title":"Evolutionary Computation"},{"key":"20_CR19_20","doi-asserted-by":"crossref","unstructured":"A. Nareyek (2003). \u201cChoosing search heuristics by non-stationary reinforcement learning.\u201d In M. Resende and J. de Sousa (eds.), Metaheuristics: Computer Decision-Making. Kluwer Academic Publishers, 523-544.","DOI":"10.1007\/978-1-4757-4137-7_25"},{"key":"20_CR20_20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1023\/A:1011211220465","volume":"20","author":"M Randall","year":"2001","unstructured":"M. Randall and D. Abramson (2001). \u201cA general meta-heuristic based solver for combinatorial optimisation problems,\u201d Computational Optimisation and Applications 20, 185-210.","journal-title":"Computational Optimisation and Applications"},{"key":"20_CR21_20","unstructured":"P. Ross, S. Schulenburg, J. G. Mar\u00edn-Bl\u00e1zquez, and E. Hart (2002). \u201cHyper-heuristics: learning to combine simple heuristics in bin-packing problems.\u201d In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002). Morgan Kauffmann, 942-948."},{"key":"20_CR22_20","unstructured":"H. Terashima-Mar\u00edn, P. Ross, and M. Valenzuela-Rend\u00f3n (1999). \u201cEvolution of constraint strategies in examination timetabling.\u201d In W. Banzhaf et al. (eds.), Proceedings of the GECCO99 Genetic and Evolutionary Computation Conference. Morgan Kaufmann, 635-642."},{"key":"20_CR23_20","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0305-0548(95)00012-7","volume":"23","author":"G Thompson","year":"1996","unstructured":"G. Thompson (1996). \u201cA simulated annealing heuristic for shift scheduling using non-continuously available employees,\u201d Computers and Operations Research 23, 275-288.","journal-title":"Computers and Operations Research"},{"key":"20_CR24_20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0167-6377(96)00042-9","volume":"20","author":"E Tsang","year":"1997","unstructured":"E. Tsang and C. Voudouris (1997). \u201cFast local search and guided local search and their application to British Telecom\u2019s workforce scheduling problem,\u201d Operations Research Letters 20, 119-127.","journal-title":"Operations Research Letters"}],"container-title":["Studies in Computational Intelligence","Evolutionary Scheduling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48584-1_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:13:34Z","timestamp":1620015214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48584-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540485827","9783540485841"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48584-1_20","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2007]]}}}