{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,5]],"date-time":"2026-07-05T12:58:39Z","timestamp":1783256319643,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540886358","type":"print"},{"value":"9783540886365","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88636-5_63","type":"book-chapter","created":{"date-parts":[[2008,10,16]],"date-time":"2008-10-16T22:19:04Z","timestamp":1224195544000},"page":"664-674","source":"Crossref","is-referenced-by-count":13,"title":["Solving a School Timetabling Problem Using a Bee Algorithm"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Lara","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan J.","family":"Flores","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"F\u00e9lix","family":"Calder\u00f3n","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"63_CR1","unstructured":"Abdullah, S., Burke, E., McCollum, B. (eds.): Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem. Computer Science Interfaces Book series. Springer Operations Research (2006)"},{"key":"63_CR2","doi-asserted-by":"crossref","unstructured":"Abdullah, S., Burke, E.K., McCollum, B.: A hybrid evolutionary approach to the university course timetabling problem. In: CEC (2007)","DOI":"10.1109\/CEC.2007.4424686"},{"issue":"2","key":"63_CR3","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. Werra de","year":"1985","unstructured":"de Werra, D.: An introduction to timetabling. European Journal of Operational Research\u00a019(2), 151\u2013162 (1985)","journal-title":"European Journal of Operational Research"},{"key":"63_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-45157-0_17","volume-title":"Practice and Theory of Automated Timetabling IV","author":"L. Gaspero Di","year":"2003","unstructured":"Di Gaspero, L., Schaerf, A.: Multi-neighbourhood local search with application to course timetabling. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 263\u2013278. Springer, Heidelberg (2003)"},{"issue":"8","key":"63_CR5","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/361082.361092","volume":"17","author":"G.A. Neufeld","year":"1974","unstructured":"Neufeld, G.A., Tartar, J.: Graph coloring conditions for the existence of solutions to the timetable problem. Commun. ACM\u00a017(8), 450\u2013453 (1974)","journal-title":"Commun. ACM"},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"Pham, D., Ghanbarzadeh, A., Ko\u00e7, E., Otri, S., Rahim, S., Zaidi, M.: The bees algorithm a novel tool for complex optimisation problems. In: IPROMS 2006 (2006)","DOI":"10.1016\/B978-008045157-2\/50081-X"},{"key":"63_CR7","unstructured":"Rossi-Doria, O., Paechter, B.: A memetic algorithm for university course timetabling. In: Combinatorial Optimisation 2004 Book of Abstracts, Lancaster, UK, Lancaster University (2004)"},{"key":"63_CR8","unstructured":"Schaerf, A.: A survey of automated timetabling. In: Centrum voor Wiskunde en Informatica (CWI), vol. 115, page\u00a033 (1995), ISSN 0169-118X"},{"key":"63_CR9","unstructured":"Schaerf, A.: Tabu search techniques for large high-school timetabling problems. In: Centrum voor Wiskunde en Informatica (CWI), vol. 88, page\u00a017 (1996), ISSN 0169-118X"}],"container-title":["Lecture Notes in Computer Science","MICAI 2008: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88636-5_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T03:03:47Z","timestamp":1548385427000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-88636-5_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540886358","9783540886365"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88636-5_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}