{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T09:23:14Z","timestamp":1763976194537},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,11]],"date-time":"2015-04-11T00:00:00Z","timestamp":1428710400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10951-015-0424-2","type":"journal-article","created":{"date-parts":[[2015,4,10]],"date-time":"2015-04-10T01:58:00Z","timestamp":1428631080000},"page":"285-293","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A complexity analysis and an algorithmic approach to student sectioning in existing timetables"],"prefix":"10.1007","volume":"19","author":[{"given":"M.","family":"Dostert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Politz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Schmitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,11]]},"reference":[{"issue":"1","key":"424_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018930930672","volume":"96","author":"R Alvarez-Valdes","year":"2000","unstructured":"Alvarez-Valdes, R., Crespo, E., & Tamarit, J. M. (2000). Assigning students to course sections using tabu search. Annals of Operations Research, 96(1), 1\u201316.","journal-title":"Annals of Operations Research"},{"key":"424_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/11593577_9","volume":"5","author":"M Amintoosi","year":"2005","unstructured":"Amintoosi, M., & Haddadnia, J. (2005). Feature selection in a fuzzy student sectioning algorithm. Practice and Theory of Automated Timetabling, 5, 147\u2013160.","journal-title":"Practice and Theory of Automated Timetabling"},{"key":"424_CR3","unstructured":"Amintoosi, M., Yazdi, H. S., & Haddadnia, J. (2004). Fuzzy student sectioning. In PATAT\u201904: Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling (pp. 421\u2013425)."},{"issue":"1","key":"424_CR4","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":"424_CR5","doi-asserted-by":"crossref","unstructured":"Carter, M. W. (2000) A comprehensive course timetabling and student scheduling system at the University of Waterloo. In PATAT \u201900: Selected papers from the third international conference on Practice and Theory of Automated Timetabling III. Berlin: Springer.","DOI":"10.1007\/3-540-44629-X_5"},{"key":"424_CR6","doi-asserted-by":"crossref","unstructured":"Carter, M. W., & Tovey, C. A. (1992). When is the classroom assignment problem hard? Operations Research, 40(1-supplement-1), S28\u2013S39.","DOI":"10.1287\/opre.40.1.S28"},{"key":"424_CR7","unstructured":"Cheng, E., Kruk, S. G., & Lipman, M. J. (2002). Flow formulations for the student scheduling problem. In Practice and Theory of Automated Timetabling IV, 4th international conference, PATAT 2002, Gent, Belgium, August 21\u201323, 2002, Selected Revised Papers, 299\u2013309."},{"key":"424_CR8","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1137\/0211043","volume":"11","author":"R Cole","year":"1982","unstructured":"Cole, R., & Hopcroft, J. (1982). On edge coloring bipartite graphs. SIAM Journal on Computing, 11, 540\u2013546.","journal-title":"SIAM Journal on Computing"},{"key":"424_CR9","unstructured":"Cooper, T. B., & Kingston, J. H. (1995). The complexity of timetable construction problems. In Practice and Theory of Automated Timetabling, first international conference, Edinburgh, UK, August 29\u2013September 1, 1995, Selected Papers, 283\u2013295."},{"key":"424_CR10","unstructured":"Csima, J. (1965). Investigations on a time-table problem. Ph.D. thesis, School of Graduate Studies, University of Toronto."},{"issue":"2","key":"424_CR11","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(2), 151\u2013162.","journal-title":"European Journal of Operational Research"},{"key":"424_CR12","unstructured":"de Werra, D. (2002). Constraints of availability in timetabling and scheduling. In Practice and Theory of Automated Timetabling IV, 4th international conference, PATAT 2002, Gent, Belgium, August 21\u201323, 2002, Selected Revised Papers, 3\u201323."},{"key":"424_CR13","unstructured":"Dostert, M., Politz, A., & Schmitz, H. (2013). Student sectioning for fixed timetables. Tech. Rep. 2013-1. Trier: Hochschule Trier."},{"key":"424_CR14","doi-asserted-by":"crossref","unstructured":"Even, S., Itai, A., & Shamir, A. (1975). On the complexity of time table and multi-commodity flow problems. In 16th annual symposium on foundations of computer science, 1975 (pp. 184\u2013193).","DOI":"10.1109\/SFCS.1975.21"},{"key":"424_CR15","volume-title":"Computers and intractability","author":"MR Garey","year":"1980","unstructured":"Garey, M. R., & Johnson, D. S. (1980). Computers and intractability. San Francisco: W. H. Freeman."},{"key":"424_CR16","unstructured":"Gotlieb, C. C. (1963). The construction of class-teacher timetables. In C. M. Popplewell (Ed.), Proceedings of IFIP congress 62 (pp. 73\u201377)."},{"key":"424_CR17","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations. New York: Plenum."},{"key":"424_CR18","unstructured":"Kingston, J. H. (2014). Integrated student sectioning. In Practice and Theory of Automated Timetabling X, tenth international conference, PATAT 2014 (pp. 489\u2013492)."},{"issue":"1","key":"424_CR19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10479-012-1160-z","volume":"218","author":"JH Kingston","year":"2014","unstructured":"Kingston, J. H. (2014). Timetable construction: The algorithms and complexity perspective. Annals of Operations Research, 218(1), 249\u2013259.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"424_CR20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10479-010-0735-9","volume":"181","author":"T M\u00fcller","year":"2010","unstructured":"M\u00fcller, T., & Murray, K. (2010). Comprehensive approach to student sectioning. Annals of Operations Research, 181(1), 249\u2013269.","journal-title":"Annals of Operations Research"},{"key":"424_CR21","unstructured":"M\u00fcller, T., Rudov\u00e1, H., & Bart\u00e1k, R. (2004). Minimal perturbation problem in course timetabling. In: PATAT\u201904: Proceedings of the 5th international conference on Practice and Theory of Automated Timetabling. Berlin: Springer."},{"key":"424_CR22","volume-title":"Computational complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. H. (1994). Computational complexity. Reading: Addison Wesley."},{"key":"424_CR23","unstructured":"Schmitz, H., & Heimfarth, C. (2010). Cross-curriculum scheduling with Themis. In PATAT\u201910: Proceedings of the 8th international conference on Practice and Theory of Automated Timetabling (pp. 385\u2013391)."},{"key":"424_CR24","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1137\/S0097539796299266","volume":"28","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A. (1998). Bipartite edge coloring in O $$(\\Delta \\text{ m })$$ ( \u0394 m ) time. SIAM Journal on Computing, 28, 841\u2013846.","journal-title":"SIAM Journal on Computing"},{"key":"424_CR25","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"DD Sleator","year":"1983","unstructured":"Sleator, D. D., & Tarjan, R. E. (1983). A data structure for dynamic trees. Journal of Computer and System Sciences, 26, 362\u2013391.","journal-title":"Journal of Computer and System Sciences"},{"key":"424_CR26","unstructured":"ten Eikelder, H. M. M., & Willemen, R. J. (2000). Some complexity aspects of secondary school timetabling problems. In Practice and Theory of Automated Timetabling III, third international conference, PATAT 2000, Konstanz, Germany, August 16\u201318, 2000, Selected Papers, 18\u201327."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0424-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0424-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0424-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,23]],"date-time":"2019-08-23T02:40:57Z","timestamp":1566528057000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0424-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,11]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["424"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0424-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,11]]}}}