{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:07:37Z","timestamp":1766135257899,"version":"3.41.2"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2000,9]]},"DOI":"10.1023\/a:1008720430012","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"279-294","source":"Crossref","is-referenced-by-count":13,"title":["Scheduling Classes on a College Campus"],"prefix":"10.1007","volume":"16","author":[{"given":"Perry","family":"Fizzano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Swanson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"271482_CR1","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows, Prentice Hall, 1993."},{"issue":"1","key":"271482_CR2","doi-asserted-by":"crossref","first-page":"S28","DOI":"10.1287\/opre.40.1.S28","volume":"40","author":"M. Carter","year":"1992","unstructured":"M. Carter and C. Tovey, \u201cWhen is the classroom assignment problem hard?\u201d Operations Research, vol. 40, supp 1, pp. S28\u2013S39, 1992.","journal-title":"Operations Research"},{"issue":"2","key":"271482_CR3","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1006\/jpdc.1996.1257","volume":"40","author":"X. Deng","year":"1997","unstructured":"X. Deng, H. Liu, J. Long, and B. Xiao, \u201cCompetitive analysis of network load balancing,\u201d Journal of Parallel and Distributed Computing, vol. 40, no. 2, pp. 162\u2013172, 1997.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"2","key":"271482_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0305-0548(85)90045-0","volume":"12","author":"J. Ferland","year":"1985","unstructured":"J. Ferland and S. Roy, \u201cTimetabling problem for university as assignment of activities to resources,\u201d Computers and Operations Research, vol. 12, no. 2, pp. 207\u2013218, 1985.","journal-title":"Computers and Operations Research"},{"key":"271482_CR5","unstructured":"J. Ferland, S. Roy, and T. Loc, \u201cThe timetabling problem,\u201d in OR Models on Microcomputers, 1986, pp. 97-103."},{"key":"271482_CR6","unstructured":"P. Fizzano, \u201cCentralized and distributed algorithms for network scheduling,\u201d PhD Thesis, Dartmouth College, 1995."},{"key":"271482_CR7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"M.L. Fredman and R.E. Tarjan, \u201cFibonacci heaps and their uses in improved network optimization algorithms,\u201d Journal of the ACM, vol. 34, pp. 596\u2013615, 1987.","journal-title":"Journal of the ACM"},{"key":"271482_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"69","author":"D. Gale","year":"1962","unstructured":"D. Gale and L.S. Shapley, \u201cCollege admissions and the stability of marraige,\u201d American Mathematical Monthly, vol. 69, pp. 9\u201314, 1962.","journal-title":"American Mathematical Monthly"},{"key":"271482_CR9","unstructured":"D. Gusfield and R.W. Irving, The Stable Marraige Problem: Structure and Algorithms, MIT Press, 1989."},{"key":"271482_CR10","doi-asserted-by":"crossref","unstructured":"D. Hochbaum (Ed.), Approximation Algorithms for NP-hard Problems, PWS, 1997.","DOI":"10.1145\/261342.571216"},{"key":"271482_CR11","unstructured":"B. Hoppe and E. Tardos, \u201cThe quickest transhipment problem,\u201d in Proceedings of the 6th Annual Symposium on Discrete Algorithms, 1995."},{"key":"271482_CR12","unstructured":"Max Planck Institute for Computer Science, \u201cLeda, the library of efficient data structures and algorithms,\u201d v. 3.1, 1995."},{"key":"271482_CR13","doi-asserted-by":"crossref","unstructured":"S. Micali and V.V. Vazirani, \u201cAn \n$$O(\\sqrt {|\\,v\\,|} \\; \\cdot |\\,E\\,|)$$\n algorithm for finding maximum matching in general graphs,\u201d in 21st Annual Symposium on Foundations of Computer Science, 1980, pp. 17-27.","DOI":"10.1109\/SFCS.1980.12"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008720430012.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008720430012\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008720430012.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:14:36Z","timestamp":1752376476000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008720430012"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["271482"],"URL":"https:\/\/doi.org\/10.1023\/a:1008720430012","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}