{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:50:15Z","timestamp":1775069415988,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424215","type":"print"},{"value":"9783540446293","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44629-x_5","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T18:09:20Z","timestamp":1183399760000},"page":"64-82","source":"Crossref","is-referenced-by-count":37,"title":["A Comprehensive Course Timetabling and Student Scheduling System at the University of Waterloo"],"prefix":"10.1007","author":[{"given":"Michael W.","family":"Carter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0305-0548(89)90053-1","volume":"16","author":"J. Aubin","year":"1989","unstructured":"Aubin, J. and Ferland, J.A., \u201cA Large Scale Timetabling Problem\u201d, Computers & Operations Research 16, 67\u201377, 1989.","journal-title":"Computers & Operations Research"},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/4235.752921","volume":"3.1","author":"E. K. Bruke","year":"1999","unstructured":"E.K. Burke and J.P. Newall, \u201cA Multi-Stage Evolutionary Algorithm for the Timetable Problem\u201d, the IEEE Transactions on Evolutionary Computation, Vol 3.1, 63\u201374, 1999","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"2","key":"5_CR3","first-page":"230","volume":"27","author":"M.W. Carter","year":"1989","unstructured":"Carter, M.W., \u201cA Lagrangian Relaxation Approach to the Classroom Assignment Problem\u201d, INFOR 27, No. 2, pp. 230\u2013246, 1989.","journal-title":"INFOR"},{"key":"5_CR4","unstructured":"Carter, M.W., \u201cA Decomposition Algorithm for Practical Timetabling Problems\u201d, Working Paper, Mechanical and Industrial Engineering, University of Toronto, 1983 (available from \n                    www.mie.utoronto.ca\/staff\/profiles\/carter.html\n                    \n                  )"},{"key":"5_CR5","unstructured":"Carter, M.W., and Gendreau, M., \u201cA Practical Algorithm to Find a Large Clique in a Graph\u201d, Working Paper, Mechanical and Industrial Engineering, University of Toronto, 1999."},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055878","volume-title":"Practice and Theory of Automated Timetabling","author":"M.W. Carter","year":"1998","unstructured":"Carter, M.W. and Laporte, G., \u201cRecent Developments in Practical Course Timetabling\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1408, E.K. Burke and M.W. Carter, eds., Springer, 1998."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"S28","DOI":"10.1287\/opre.40.1.S28","volume":"40","author":"M.W. Carter","year":"1992","unstructured":"Carter, M.W. and Tovey, C.A., \u201cWhen Is the Classroom Assignment Problem Hard? \u201d, Operations Research 40, S28\u2013S39, 1992.","journal-title":"Operations Research"},{"key":"5_CR8","volume-title":"Integer Programming and Network Flows","author":"T.C. Hu","year":"1969","unstructured":"Hu, T.C., Integer Programming and Network Flows, Addison-Wesley, Reading, MA, 1969."},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Paechter, B., Cumming, A. and Luchian, H., \u201cThe Use of Local Search Suggestion Lists for Improving the Solution of Timetable Problems with Evolutionary Algorithms\u201d, In Proceedings of the AISB Workshop on Evolutionary Computing, (Sheffield, April 3~7, 1995.","DOI":"10.1007\/3-540-60469-3_27"},{"key":"5_CR10","series-title":"Lect Notes Comput Sci","volume-title":"Practice and Theory of Automated Timetabling","author":"R.C. Rankin","year":"1996","unstructured":"Rankin, R.C., \u201cAutomatic Timetabling in Practice\u201d, in Practice and Theory of Automated Timetabling, Springer-Verlag Lecture Notes in Computer Science 1153, E.K. Burke and P. Ross, eds., Springer, 1996."},{"issue":"3","key":"5_CR11","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1287\/inte.25.3.30","volume":"25","author":"S.E. Sampson","year":"1995","unstructured":"Sampson, S.E., Freeland, J.R. and Weiss, E.N., \u201cClass Scheduling to Maximize Participant Satisfaction\u201d, Interfaces 25, No. 3, 30\u201341, 1995.","journal-title":"Interfaces"},{"key":"5_CR12","unstructured":"University of Waterloo web site \n                    http:\/\/www.uwaterloo.ca"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling III"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44629-X_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T17:10:45Z","timestamp":1550423445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44629-X_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424215","9783540446293"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44629-x_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}