{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:34:18Z","timestamp":1767339258418,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030589417"},{"type":"electronic","value":"9783030589424"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58942-4_19","type":"book-chapter","created":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:03:58Z","timestamp":1600409038000},"page":"283-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Optimizing Student Course Preferences in School Timetabling"],"prefix":"10.1007","author":[{"given":"Richard","family":"Hoshino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irene","family":"Fabris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,19]]},"reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251\u20136 (1979)","journal-title":"Commun. ACM"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10479-010-0716-z","volume":"179","author":"EK Burke","year":"2010","unstructured":"Burke, E.K., Marec\u0306ek, J., Parkes, A., Rudov\u00e1, H.: A supernodal formulation of vertex colouring with applications in course timetabling. Ann. Oper. Res. 179(1), 105\u2013130 (2010). \nhttps:\/\/doi.org\/10.1007\/s10479-010-0716-z","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10479-010-0737-7","volume":"194","author":"H Cambazard","year":"2012","unstructured":"Cambazard, H., H\u00e9brard, E., O\u2019Sullivan, B., Papadopoulos, A.: Local search and constraint programming for the post enrolment-based course timetabling problem. Ann. Oper. Res. 194(1), 111\u2013135 (2012). \nhttps:\/\/doi.org\/10.1007\/s10479-010-0737-7","journal-title":"Ann. Oper. Res."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-44629-X_5","volume-title":"Practice and Theory of Automated Timetabling III","author":"MW Carter","year":"2001","unstructured":"Carter, M.W.: A comprehensive course timetabling and student scheduling system at the University of Waterloo. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 64\u201382. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44629-X_5"},{"key":"19_CR5","unstructured":"Chiarandini, M., Fawcett, C., Hoos, H.H.: A modular multiphase heuristic solver for post enrolment course timetabling. In: PATAT (2008)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-93031-2_10","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"E Demirovi\u0107","year":"2018","unstructured":"Demirovi\u0107, E., Stuckey, P.J.: Constraint programming for high school timetabling: a scheduling-based model with hot starts. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 135\u2013152. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-93031-2_10"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"ASS Even","year":"1976","unstructured":"Even, A.S.S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM J. Comput. 5(4), 691\u2013703 (1976)","journal-title":"SIAM J. Comput."},{"key":"19_CR8","unstructured":"Fonseca, G.H., Santos, H.G., Carrano, E.G., Stidsen, T.J.: Modelling and solving university course timetabling problems through XHSTT. In: PATAT, vol. 16, pp. 127\u2013138 (2016)"},{"key":"19_CR9","unstructured":"Google OR-Tools: Fast and portable software for combinatorial optimization. \nhttps:\/\/developers.google.com\/optimization\n\n. Accessed 17 Feb 2020"},{"key":"19_CR10","unstructured":"Gotlieb, C.C.: The construction of class-teacher timetables. In: IFIP Congress, Amsterdam, vol. 62, pp. 73\u201377 (1963)"},{"key":"19_CR11","unstructured":"GrinPy: A NetworkX extension for calculating graph invariants. \nhttps:\/\/pypi.org\/project\/grinpy\/\n\n. Accessed 17 Feb 2020"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"H\u00e9brard, E., Katsirelos, G.: A hybrid approach for exact coloring of massive graphs. In: Rousseau, L.-M., Stergiou, K. (eds.) CPAIOR 2019. LNCS, vol. 11494, pp. 374\u2013390. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-19212-9_25","DOI":"10.1007\/978-3-030-19212-9_25"},{"key":"19_CR13","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. IRSS, pp. 85\u2013103. Springer, Boston (1972). \nhttps:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10951-014-0405-x","volume":"18","author":"S Kristiansen","year":"2014","unstructured":"Kristiansen, S., S\u00f8rensen, M., Stidsen, T.R.: Integer programming for the generalized high school timetabling problem. J. Sched. 18(4), 377\u2013392 (2014). \nhttps:\/\/doi.org\/10.1007\/s10951-014-0405-x","journal-title":"J. Sched."},{"issue":"1","key":"19_CR15","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10479-014-1593-7","volume":"239","author":"S Kristiansen","year":"2014","unstructured":"Kristiansen, S., Stidsen, T.R.: Elective course student sectioning at Danish high schools. Ann. Oper. Res. 239(1), 99\u2013117 (2014). \nhttps:\/\/doi.org\/10.1007\/s10479-014-1593-7","journal-title":"Ann. Oper. Res."},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-68552-4_18","volume-title":"Experimental Algorithms","author":"G Lach","year":"2008","unstructured":"Lach, G., L\u00fcbbecke, M.E.: Optimal university course timetables and the partial transversal polytope. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 235\u2013248. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-68552-4_18"},{"key":"19_CR17","unstructured":"Lewis, R., Paechter, R., McCollum, B.: Post enrolment based course timetabling: a description of the problem model used for track two of the second international timetabling competition (2007)"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhang, D., Leung, S.C.: A simulated annealing algorithm with a new neighborhood structure for the timetabling problem. In: Proceedings of the First ACM\/SIGEVO Summit on Genetic and Evolutionary Computation, pp. 381\u2013386 (2009)","DOI":"10.1145\/1543834.1543885"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.cor.2016.06.018","volume":"76","author":"I M\u00e9ndez-D\u00edaz","year":"2016","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P., Miranda-Bront, J.J.: An ILP based heuristic for a generalization of the post-enrollment course timetabling problem. Comput. Oper. Res. 76, 195\u2013207 (2016)","journal-title":"Comput. Oper. Res."},{"key":"19_CR20","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-12090-9_26","volume-title":"Advances in Intelligent Information and Database Systems","author":"KNTT Minh","year":"2010","unstructured":"Minh, K.N.T.T., Thanh, N.D.T., Trang, K.T., Hue, N.T.T.: Using Tabu search for solving a high school timetabling problem. In: Nguyen, N.T., Katarzyniak, R., Chen, S.M. (eds.) Advances in Intelligent Information and Database Systems. SCI, vol. 283, pp. 305\u2013313. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-12090-9_26"},{"key":"19_CR21","unstructured":"NetworkX: Software for complex networks. \nhttps:\/\/networkx.github.io\/\n\n. Accessed 17 Feb 2020"},{"issue":"1","key":"19_CR22","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10479-012-1078-5","volume":"194","author":"C Nothegger","year":"2012","unstructured":"Nothegger, C., Mayer, A., Chwatal, A., Raidl, G.R.: Solving the post enrolment course timetabling problem by ant colony optimization. Ann. Oper. Res. 194(1), 325\u2013339 (2012). \nhttps:\/\/doi.org\/10.1007\/s10479-012-1078-5","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"19_CR23","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10479-013-1321-8","volume":"218","author":"N Pillay","year":"2014","unstructured":"Pillay, N.: A survey of school timetabling research. Ann. Oper. Res. 218(1), 261\u2013293 (2014). \nhttps:\/\/doi.org\/10.1007\/s10479-013-1321-8","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"19_CR24","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s10479-010-0699-9","volume":"194","author":"G Post","year":"2012","unstructured":"Post, G., et al.: An XML format for benchmarks in high school timetabling. Ann. Oper. Res. 194(1), 385\u2013397 (2012). \nhttps:\/\/doi.org\/10.1007\/s10479-010-0699-9","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"19_CR25","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10479-011-1012-2","volume":"218","author":"G Post","year":"2011","unstructured":"Post, G., et al.: XHSTT: an XML archive for high school timetabling problems in different countries. Ann. Oper. Res. 218(1), 295\u2013301 (2011). \nhttps:\/\/doi.org\/10.1007\/s10479-011-1012-2","journal-title":"Ann. Oper. Res."},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Raghavjee, R., Pillay, N.: An application of genetic algorithms to the school timetabling problem. In: Proceedings of the 2008 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists on IT Research in Developing Countries: Riding the Wave of Technology, pp. 193\u2013199 (2008)","DOI":"10.1145\/1456659.1456682"},{"issue":"43","key":"19_CR27","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.cor.2013.08.025","volume":"1","author":"M S\u00f8rensen","year":"2014","unstructured":"S\u00f8rensen, M., Dahms, F.H.W.: A two-stage decomposition of high school timetabling applied to cases in Denmark. Comput. Oper. Res. 1(43), 36\u201349 (2014)","journal-title":"Comput. Oper. Res."},{"key":"19_CR28","unstructured":"St. Margaret\u2019s Boarding School Viewbook. \nhttps:\/\/www.stmarg.ca\/wp-content\/uploads\/SMS-Boarding-Viewbook.pdf\n\n. Accessed 17 Feb 2020"},{"issue":"3","key":"19_CR29","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1016\/j.ejor.2008.04.038","volume":"196","author":"J Van Den Broek","year":"2009","unstructured":"Van Den Broek, J., Hurkens, C., Woeginger, G.: Timetabling problems at the TU Eindhoven. Eur. J. Oper. Res. 196(3), 877\u2013885 (2009)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58942-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,18]],"date-time":"2020-09-18T06:09:22Z","timestamp":1600409362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-58942-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030589417","9783030589424"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58942-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2020.dbai.tuwien.ac.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"72","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.08","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}