{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T05:38:48Z","timestamp":1778737128475,"version":"3.51.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,12,17]],"date-time":"2009-12-17T00:00:00Z","timestamp":1261008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s10951-009-0153-5","type":"journal-article","created":{"date-parts":[[2009,12,16]],"date-time":"2009-12-16T20:30:26Z","timestamp":1260995426000},"page":"375-391","source":"Crossref","is-referenced-by-count":8,"title":["Term-end exam scheduling at United States Military Academy\/West Point"],"prefix":"10.1007","volume":"13","author":[{"given":"Siqun","family":"Wang","sequence":"first","affiliation":[]},{"given":"Michael","family":"Bussieck","sequence":"additional","affiliation":[]},{"given":"Monique","family":"Guignard","sequence":"additional","affiliation":[]},{"given":"Alexander","family":"Meeraus","sequence":"additional","affiliation":[]},{"given":"Fred","family":"O\u2019Brien","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,12,17]]},"reference":[{"key":"153_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1093\/comjnl\/3.4.237","volume":"3","author":"J. S. Appleby","year":"1961","unstructured":"Appleby, J. S., Blake, D. V., & Newman, E. A. (1961). Techniques for producing school timetables on a computer and their application to other scheduling problems. The Computer Journal, 3, 237\u2013245.","journal-title":"The Computer Journal"},{"key":"153_CR2","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/0377-2217(88)90158-0","volume":"34","author":"T. Arani","year":"1988","unstructured":"Arani, T., Karwan, M., & Lofti, V. (1988). A Lagrangian relaxation approach to solve the second phase of the exam scheduling problem. European Journal of Operational Research, 34, 372\u2013383.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"153_CR3","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0305-0548(89)90053-1","volume":"16","author":"J. Aubin","year":"1989","unstructured":"Aubin, J., & Ferland, J. A. (1989). A large scale timetabling problem. Computers and Operations Research, 16(1), 67\u201377.","journal-title":"Computers and Operations Research"},{"key":"153_CR4","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s10951-005-4780-1","volume":"8","author":"P. Avella","year":"2005","unstructured":"Avella, P., & Vasilev, I. (2005). A computational study of a cutting plane algorithm for university course timetabling. Journal of Scheduling, 8, 497\u2013514.","journal-title":"Journal of Scheduling"},{"key":"153_CR5","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/3-540-64575-6_37","volume-title":"Advances in artificial intelligence","author":"D. Banks","year":"1998","unstructured":"Banks, D., van Beek, P., & Meisels, A. (1998). A heuristic incremental modeling approach to course timetabling. In Lecture notes in computer science : Vol. 1418. Advances in artificial intelligence (pp. 16\u201329). Berlin: Springer."},{"key":"153_CR6","unstructured":"Beyrouthy, C., Burke, E. K., Landa-Silva, D., McCollum, B., McMullan, P., & Parkes, A. J. (2008). Conflict inheritance in sectioning and space planning. In Practice and theory of automated timetabling (PATAT 2008), Montreal, 19\u201322 August 2008."},{"key":"153_CR7","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1057\/palgrave.jors.2600480","volume":"48","author":"T. Birbas","year":"1997","unstructured":"Birbas, T., Daskalaki, S., & Housos, E. (1997). Timetabling for Greek high schools. The Journal of the Operational Research Society, 48, 1191\u20131200.","journal-title":"The Journal of the Operational Research Society"},{"key":"153_CR8","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1016\/j.cor.2006.10.016","volume":"35","author":"N. Boland","year":"2008","unstructured":"Boland, N., Hughes, B. D., Merlot, L. T. G., & Stuckey, P. J. (2008). New integer linear programming approaches for course timetabling. Computers and Operations Research, 35, 2209\u20132233.","journal-title":"Computers and Operations Research"},{"key":"153_CR9","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BFb0055882","volume-title":"Practice and theory of automated timetabling II","author":"B. Bullnheimer","year":"1998","unstructured":"Bullnheimer, B. (1998). An examination scheduling model to maximize students\u2019 study time. In Lecture notes in computer science : Vol. L1408. Practice and theory of automated timetabling II (pp. 78\u201391). Berlin: Springer."},{"key":"153_CR10","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"E. K. Burke","year":"2002","unstructured":"Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140, 266\u2013280.","journal-title":"European Journal of Operational Research"},{"key":"153_CR11","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-61794-9_52","volume-title":"Practice and theory of automated timetabling","author":"E. K. Burke","year":"1996","unstructured":"Burke, E. K., Elliman, D. G., & Weare, R. F. (1996a). Examination timetabling in British universities\u2014a survey. In Lecture notes in computer science : Vol. 1153. Practice and theory of automated timetabling (pp. 76\u201392). Berlin: Springer."},{"issue":"1","key":"153_CR12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1086\/442567","volume":"69","author":"R. N. Bush","year":"1961","unstructured":"Bush, R. N., Caffrey, J. G., Oakford, R. V., & Allen, D. W. (1961). Using machines to make the high school schedule. The School Review, 69(1), 48\u201359.","journal-title":"The School Review"},{"key":"153_CR13","unstructured":"Bussieck, M., Guignard, M., Meeraus, A., O\u2019Brien, F., & Wang, S. (2001). Term end exam scheduling at United States Military Academy\/West Point (OPIM Department Report 01-10-01). University of Pennsylvania."},{"key":"153_CR14","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.14.1.52","volume":"14","author":"R. C. Carlson","year":"1966","unstructured":"Carlson, R. C., & Nemhauser, G. L. (1966). Scheduling to minimize interaction cost. Operations Research, 14, 52\u201358.","journal-title":"Operations Research"},{"key":"153_CR15","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"M. W. Carter","year":"1986","unstructured":"Carter, M. W. (1986). A survey of practical applications of examination timetabling algorithms. Operations Research, 34, 193\u2013202.","journal-title":"Operations Research"},{"key":"153_CR16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"47","author":"M. W. Carter","year":"1996","unstructured":"Carter, M. W., Laporte, G., & Lee, S. Y. (1996). Examination timetabling: Algorithmic strategies and applications. Journal of the Operational Research Society, 47, 373\u2013383.","journal-title":"Journal of the Operational Research Society"},{"key":"153_CR17","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ejor.2003.06.023","volume":"160","author":"S. Daskalaki","year":"2005","unstructured":"Daskalaki, S., & Birbas, T. (2005). Efficient solutions for a university timetabling problem through integer programming. European Journal of Operational Research, 160, 106\u2013120.","journal-title":"European Journal of Operational Research"},{"key":"153_CR18","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0377-2217(85)90167-5","volume":"19","author":"D. Werra de","year":"1985","unstructured":"de Werra, D. (1985). An introduction to timetabling. European Journal of Operational Research, 19, 151\u2013162.","journal-title":"European Journal of Operational Research"},{"key":"153_CR19","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/S0377-2217(00)00052-7","volume":"130","author":"M. Dimopoulou","year":"2001","unstructured":"Dimopoulou, M., & Miliotis, P. (2001). Implementation of a university course and examination timetabling system. European Journal of Operational Research, 130, 202\u2013213.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"153_CR20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0548(85)90045-0","volume":"12","author":"J. A. Ferland","year":"1985","unstructured":"Ferland, J. A., & Roy, S. (1985). Timetabling problem for university as assignment of activities to resources. Computers and Operations Research, 12(2), 207\u2013218.","journal-title":"Computers and Operations Research"},{"key":"153_CR21","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1057\/jors.1981.207","volume":"32","author":"A. M. Frieze","year":"1981","unstructured":"Frieze, A. M., & Yadegar, J. (1981). An algorithm for solving 3-dimensional assignment problems with applications to scheduling a teaching practice. Journal of Operational Research Society, 32, 989\u2013995.","journal-title":"Journal of Operational Research Society"},{"key":"153_CR22","first-page":"73","volume-title":"Proceeding of IFIP congress Munchen 1962","author":"C. C. Gotlieb","year":"1962","unstructured":"Gotlieb, C. C. (1962). The construction of class-teacher timetables. In C. M. Popplewell (Ed.), Proceeding of IFIP congress Munchen 1962 (pp. 73\u201377). Amsterdam: North-Holland."},{"key":"153_CR23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0377-2217(91)90321-L","volume":"54","author":"A. Hertz","year":"1991","unstructured":"Hertz, A. (1991). Tabu search for large scale timetabling problems. European Journal of Operational Research, 54, 39\u201347.","journal-title":"European Journal of Operational Research"},{"key":"153_CR24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1093\/comjnl\/12.4.307","volume":"12","author":"N. L. Lawrie","year":"1969","unstructured":"Lawrie, N. L. (1969). An integer linear programming model of a school timetabling problem. The Computer Journal, 12, 307\u2013316.","journal-title":"The Computer Journal"},{"key":"153_CR25","unstructured":"M\u00fcller, T., & Murray, K. (2008). Comprehensive approach to student sectioning. In PATAT 2008\u2014Proceedings of the 7th international conference on the practice and theory of automated timetabling."},{"issue":"1","key":"153_CR26","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10951-008-0077-5","volume":"12","author":"R. Qu","year":"2009","unstructured":"Qu, R., Burke, E., McCollum, B., Merlot, L., & Lee, S. (2009). A survey of search methodologies and automated system development for examination timetabling. Journal of Scheduling, 12(1), 55\u201389.","journal-title":"Journal of Scheduling"},{"key":"153_CR27","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1007\/3-540-61794-9_71","volume-title":"Practice and theory of automated timetabling","author":"V. Robert","year":"1996","unstructured":"Robert, V., & Hertz, A. (1996). How to decompose constrained course scheduling problems into easier assignment type subproblems. In Lecture notes in computer science : Vol. 1153. Practice and theory of automated timetabling (pp. 364\u2013373). Berlin: Springer."},{"issue":"2","key":"153_CR28","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A. Schaerf","year":"1999","unstructured":"Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87\u2013127.","journal-title":"Artificial Intelligence Review"},{"key":"153_CR29","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1111\/j.1540-5915.1977.tb01114.x","volume":"8","author":"W. Shih","year":"1977","unstructured":"Shih, W., & Sullivan, J. A. (1977). Dynamic course scheduling for college faculty via zero-one programming. Decision Sciences, 8, 711\u2013721.","journal-title":"Decision Sciences"},{"key":"153_CR30","doi-asserted-by":"crossref","first-page":"1473","DOI":"10.1287\/mnsc.30.12.1473","volume":"30","author":"A. Tripathy","year":"1984","unstructured":"Tripathy, A. (1984). School timetabling\u2014a\u00a0case in large binary integer linear programming. Management Science, 30, 1473\u20131489.","journal-title":"Management Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0153-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0153-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0153-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:44Z","timestamp":1559468384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0153-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,17]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["153"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0153-5","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,17]]}}}