{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:55:54Z","timestamp":1725573354627},"publisher-location":"Berlin, Heidelberg","reference-count":6,"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_13","type":"book-chapter","created":{"date-parts":[[2005,11,5]],"date-time":"2005-11-05T07:32:45Z","timestamp":1131175965000},"page":"208-225","source":"Crossref","is-referenced-by-count":25,"title":["A Tiling Algorithm for High School Timetabling"],"prefix":"10.1007","author":[{"given":"Jeffrey H.","family":"Kingston","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BFb0055878","volume-title":"Practice and Theory of Automated Timetabling II","author":"M.W. Carter","year":"1998","unstructured":"Carter, M.W., Laporte, G.: Recent Developments in Practical Course Timetabling. In: Burke, E.K., Carter, M. (eds.) PATAT 1997. LNCS, vol.\u00a01408, pp. 3\u201319. Springer, Heidelberg (1998)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1093\/comjnl\/36.7.645","volume":"36","author":"T.B. Cooper","year":"1993","unstructured":"Cooper, T.B., Kingston, J.H.: The Solution of Real Instances of the Timetabling Problem. Comput. J.\u00a036, 645\u2013653 (1993)","journal-title":"Comput. J."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","first-page":"283","volume-title":"Practice and Theory of Automated Timetabling","author":"T.B. Cooper","year":"1996","unstructured":"Cooper, T.B., Kingston, J.H.: The Complexity of Timetable Construction Problems. In: Burke, E.K., Ross, P. (eds.) PATAT 1995. LNCS, vol.\u00a01153, pp. 283\u2013295. Springer, Heidelberg (1996)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/ir.37019771306","volume":"13","author":"J.S. Dyer","year":"1977","unstructured":"Dyer, J.S., Mulvey, J.M.: Computerized Scheduling and Planning. New Directions Inst. Res.\u00a013, 67\u201386 (1977)","journal-title":"New Directions Inst. Res."},{"key":"13_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"13_CR6","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. Eur. J. Oper. Res.\u00a019, 151\u2013162 (1985)","journal-title":"Eur. J. Oper. Res."}],"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_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:51:54Z","timestamp":1619506314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11593577_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540307051","9783540324218"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/11593577_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}