{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T22:37:17Z","timestamp":1782772637277,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540617945","type":"print"},{"value":"9783540706823","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61794-9_66","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:26:41Z","timestamp":1330295201000},"page":"281-295","source":"Crossref","is-referenced-by-count":57,"title":["The complexity of timetable construction problems"],"prefix":"10.1007","author":[{"given":"Tim B.","family":"Cooper","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jeffrey H.","family":"Kingston","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1093\/comjnl\/36.7.645","volume":"36","author":"T. B. Cooper","year":"1993","unstructured":"Tim B. Cooper and Jeffrey H. Kingston. The solution of real instances of the timetabling problem. The Computer Journal\n36, 645\u2013653 (1993).","journal-title":"The Computer Journal"},{"key":"18_CR2","volume-title":"A program for constructing high school timetables","author":"T. B. Cooper","year":"1995","unstructured":"Tim B. Cooper and Jeffrey H. Kingston. A program for constructing high school timetables. In First International Conference on the Practice and Theory of Automated Timetabling. Napier University, Edinburgh, UK, 1995. Also ftp:\/\/ftp.cs.su.oz.au\/pub\/tr\/TR95_496.ps.Z."},{"key":"18_CR3","unstructured":"J. Csima. Investigations on a Time-Table Problem. Ph.D. thesis, School of Graduate Studies, University of Toronto, 1965."},{"key":"18_CR4","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"S. Even, A. Itai, and A. Shamir. On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing\n5, 691\u2013703 (1976).","journal-title":"SIAM Journal on Computing"},{"key":"18_CR5","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979."},{"key":"18_CR6","unstructured":"C.C. Gotlieb. The construction of class-teacher timetables. In Proc. IFIP Congress, pages 73\u201377, 1962."},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher (eds.), Complexity of Computer Computations, pages 85\u2013103. Plenum Press, New York, 1972."},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/comjnl\/23.4.307","volume":"23","author":"G. Schmidt","year":"1980","unstructured":"G. Schmidt and T. Str\u00f6hlein. Timetable construction \u2014 An annotated bibliography. The Computer Journal\n23, 307\u2013316 (1980).","journal-title":"The Computer Journal"},{"key":"18_CR9","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D. J. A. Welsh","year":"1967","unstructured":"D. J. A. Welsh and M. B. Powell. An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal\n10, 85\u201386 (1967).","journal-title":"The Computer Journal"},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1080\/03155986.1971.11731456","volume":"9","author":"D. Werra de","year":"1971","unstructured":"D. de Werra. Construction of school timetables by flow methods. INFOR \u2014 Canadian Journal of Operations Research and Information Processing\n9, 12\u201322 (1971).","journal-title":"INFOR \u2014 Canadian Journal of Operations Research and Information Processing"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61794-9_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:36:47Z","timestamp":1619573807000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61794-9_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617945","9783540706823"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-61794-9_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}