{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:43:58Z","timestamp":1648986238156},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,8]],"date-time":"2014-05-08T00:00:00Z","timestamp":1399507200000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10479-014-1593-7","type":"journal-article","created":{"date-parts":[[2014,5,7]],"date-time":"2014-05-07T21:25:09Z","timestamp":1399497909000},"page":"99-117","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Elective course student sectioning at Danish high schools"],"prefix":"10.1007","volume":"239","author":[{"given":"Simon","family":"Kristiansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas R.","family":"Stidsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,8]]},"reference":[{"key":"1593_CR1","unstructured":"Azi, N., Gendreau, M., & Potvin, J.-Y. (2010). An adaptive large neighborhood search for a vehicle routing problem with multiple trips. CIRRELT."},{"key":"1593_CR2","doi-asserted-by":"crossref","unstructured":"Balaprakash, P., Birattari, M., & St\u00fctzle, T. (2007). Improvement strategies for the f-race algorithm: Sampling design and iterative refinement. In Proceedings of the 4th international conference on Hybrid metaheuristics, HM\u201907. Springer, Berlin, pp. 108\u2013122.","DOI":"10.1007\/978-3-540-75514-2_9"},{"key":"1593_CR3","unstructured":"Birattari, M. (2005). The problem of tuning metaheuristics as seen from a machine learning perspective (1st ed.). Dissertations in artificial intelligence\u2014Infix (Vol. 292). Springer."},{"issue":"2","key":"1593_CR4","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"EK Burke","year":"2002","unstructured":"Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140(2), 266\u2013280. ISSN 0377\u20132217.","journal-title":"European Journal of Operational Research"},{"key":"1593_CR5","doi-asserted-by":"crossref","unstructured":"Carter, M. W. (2001). A comprehensive course timetabling and student scheduling system at the university of waterloo. In E. Burke & W. Erben (Eds.), Practice and theory of automated timetabling III. Lecture Notes in Computer Science (Vol. 2079, pp. 64\u201382) Berlin: Springer. ISBN 978-3-540-42421-5.","DOI":"10.1007\/3-540-44629-X_5"},{"key":"1593_CR6","doi-asserted-by":"crossref","unstructured":"Carter, M. W., & Laporte, G. (1998). Recent developments in practical course timetabling. In Ed. Burke & M. Carter (Eds.), Practice and theory of automated timetabling II. Lecture Notes in Computer Science (Vol. 1408, pp. 3\u201319). Berlin: Springer.","DOI":"10.1007\/BFb0055878"},{"key":"1593_CR7","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10951-006-8495-8","volume":"9","author":"M Chiarandini","year":"2006","unstructured":"Chiarandini, M., Birattari, M., Socha, K., & Rossi-Doria, O. (2006). An effective hybrid algorithm for university course timetabling. Journal of Scheduling, 9, 403\u2013432. ISSN 1094\u20136136.","journal-title":"Journal of Scheduling"},{"key":"1593_CR8","doi-asserted-by":"crossref","unstructured":"de Haan, P., Landman, R., Post, G., & Ruizenaar, H. (2007). A case study for timetabling in a dutch secondary school. In E. Burke & H. Rudova (Eds.), Practice and theory of automated timetabling VI. Lecture Notes in Computer Science (Vol. 3867, pp. 267\u2013279). Berlin: Springer.","DOI":"10.1007\/978-3-540-77345-0_17"},{"key":"1593_CR9","doi-asserted-by":"crossref","unstructured":"Erben, W., & Keppler, J. (1996). A genetic algorithm solving a weekly course-timetabling problem. In E. Burke & P. Ross (Eds.), Practice and theory of automated timetabling. Lecture Notes in Computer Science (Vol. 1153, pp. 198\u2013211). Berlin: Springer.","DOI":"10.1007\/3-540-61794-9_60"},{"issue":"3","key":"1593_CR10","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1016\/j.ejor.2011.06.039","volume":"215","author":"S Kristiansen","year":"2011","unstructured":"Kristiansen, S., S\u00f8rensen, M., & Stidsen, T. R. (2011). Elective course planning. European Journal of Operational Research, 215(3), 713\u2013720. doi: 10.1016\/j.ejor.2011.06.039 . ISSN 0377-2217.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1593_CR11","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/s10732-013-9219-9","volume":"19","author":"S Kristiansen","year":"2013","unstructured":"Kristiansen, S., S\u00f8rensen, M., Herold, M. B., & Stidsen, T. R. (2013). The consultation timetabling problem at danish high schools. Journal of Heuristics, 19(3), 465\u2013495.","journal-title":"Journal of Heuristics"},{"issue":"1","key":"1593_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1287\/trsc.1090.0290","volume":"44","author":"G Laporte","year":"2010","unstructured":"Laporte, G., Musmanno, R., & Vocaturo, F. (2010). An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transportation Science, 44(1), 125\u2013135.","journal-title":"Transportation Science"},{"issue":"12","key":"1593_CR13","doi-asserted-by":"crossref","first-page":"1775","DOI":"10.1016\/j.cor.2011.02.007","volume":"38","author":"H Lei","year":"2011","unstructured":"Lei, H., Laporte, G., & Guo, B. (2011). The capacitated vehicle routing problem with stochastic demands and time windows. Computers & Operations Research, 38(12), 1775\u20131783. doi: 10.1016\/j.cor.2011.02.007 . ISSN 0305\u20130548.","journal-title":"Computers & Operations Research"},{"key":"1593_CR14","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, 249\u2013269. ISSN 0254\u20135330.","journal-title":"Annals of Operations Research"},{"key":"1593_CR15","unstructured":"Muller, L. F., & Spoorendonk, S. (2010). A hybrid adaptive large neighborhood search algorithm applied to a lot-sizing problem. DTU Management Engineering: Technical report."},{"key":"1593_CR16","unstructured":"Muller, L. F. (2009). An adaptive large neighborhood search algorithm for the resource-constrained project scheduling problem. In MIC 2009: The VIII Metaheuristics International Conference."},{"key":"1593_CR17","doi-asserted-by":"crossref","unstructured":"Pellegrini, P., & Birattari, M. (2007). Implementation effort and performance. pp. 31\u201345.","DOI":"10.1007\/978-3-540-74446-7_3"},{"key":"1593_CR18","unstructured":"Pillay, N. (2010). An overview of school timetabling research. In Proceedings of the international conference on the theory and practice of automated timetabling (pp. 321\u2013335). Belfast, United Kingdom."},{"key":"1593_CR19","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D., & Ropke, S. (2005). A general heuristic for vehicle routing problems. Computers & Operations Research, 34, 2403\u20132435. ISSN 0305\u20130548.","journal-title":"Computers & Operations Research"},{"key":"1593_CR20","doi-asserted-by":"crossref","unstructured":"Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of metaheuristics (Vol. 146, pp. 399\u2013419). International Series in Operations Research & Management Science. New York: Springer. ISBN 978-1-4419-1665-5.","DOI":"10.1007\/978-1-4419-1665-5_13"},{"key":"1593_CR21","unstructured":"Post, G., Di Gaspero, L., Kingston, J. H., McCollum, B., & Schaerf, A. (2012). The third international timetabling competition. In Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), Son, Norway."},{"issue":"3","key":"1593_CR22","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","volume":"39","author":"GM Ribeiro","year":"2012","unstructured":"Ribeiro, G. M., & Laporte, G. (2012). An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Computers & Operations Research, 39(3), 728\u2013735. ISSN 0305-0548.","journal-title":"Computers & Operations Research"},{"key":"1593_CR23","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science, 40, 455\u2013472. ISSN 1526\u20135447.","journal-title":"Transportation Science"},{"key":"1593_CR24","doi-asserted-by":"crossref","unstructured":"Rudova, H., & Murray, K. (2003). University course timetabling with soft constraints. In Practice and theory of automated timetabling IV, pp. 310\u2013328.","DOI":"10.1007\/978-3-540-45157-0_21"},{"key":"1593_CR25","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, 87\u2013127. ISSN 0269\u20132821.","journal-title":"Artificial Intelligence Review"},{"key":"1593_CR26","unstructured":"Shaw, P. (1997). A new local search algorithm providing high quality solutions to vehicle routing problems."},{"key":"1593_CR27","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In M. Maher & J.-F. Puget (Eds.), Principles and practice of constraint programming CP98. Lecture Notes in Computer Science (Vol. 1520, pp. 417\u2013431). Berlin: Springer.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"1593_CR28","unstructured":"S\u00f8rensen, M., & Stidsen, T. R. (2013). Integer programming and adaptive large neighborhood search for real-world instances of high school timetabling. Annals of Operations Research, PATAT 2012 SI."},{"key":"1593_CR29","unstructured":"S\u00f8rensen, M., Kristiansen, S., & Stidsen, T. R. (2012). International timetabling competition 2011: An adaptive large neighborhood search algorithm. In Proceedings of the ninth international conference on the practice and theory of automated timetabling (PATAT 2012), pp. 489\u2013492. SINTEF."},{"key":"1593_CR30","doi-asserted-by":"crossref","unstructured":"Steeg, J., & Schr\u00f6der, M. (2008). A hybrid approach to solve the periodic home health care problem. In J. Kalcsics & S. Nickel (Eds.), Operations research proceedings 2007. Operations Research Proceedings (Vol. 2007, pp. 297\u2013302). Berlin: Springer. ISBN 978-3-540-77903-2.","DOI":"10.1007\/978-3-540-77903-2_46"},{"key":"1593_CR31","doi-asserted-by":"crossref","unstructured":"Welsh, D. J. A., & Powell, M. B. (1967). An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal, 10(1): 85\u201386. doi: 10.1093\/comjnl\/10.1.85 . URL http:\/\/comjnl.oxfordjournals.org\/content\/10\/1\/85.abstract .","DOI":"10.1093\/comjnl\/10.1.85"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1593-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-014-1593-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-014-1593-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:49Z","timestamp":1559153389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-014-1593-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,8]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["1593"],"URL":"https:\/\/doi.org\/10.1007\/s10479-014-1593-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,8]]}}}