{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T12:08:23Z","timestamp":1743336503409,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T00:00:00Z","timestamp":1631232000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T00:00:00Z","timestamp":1631232000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006012","name":"Christian Doppler Forschungsgesellschaft","doi-asserted-by":"publisher","award":["Christian Doppler Laboratory for Artificial Intelligence and Optimization for Planning and Scheduling"],"id":[{"id":"10.13039\/501100006012","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100005012","name":"\u00d6sterreichische Agentur f\u00fcr Internationale Mobilit\u00e4t und Kooperation in Bildung, Wissenschaft und Forschung","doi-asserted-by":"publisher","award":["K-05-2017"],"id":[{"id":"10.13039\/501100005012","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["FL140100012"],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10951-021-00701-x","type":"journal-article","created":{"date-parts":[[2021,9,10]],"date-time":"2021-09-10T09:02:31Z","timestamp":1631264551000},"page":"35-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Algorithm selection and instance space analysis for curriculum-based course timetabling"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8496-3231","authenticated-orcid":false,"given":"Arnaud","family":"De Coster","sequence":"first","affiliation":[]},{"given":"Nysret","family":"Musliu","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[]},{"given":"Johannes","family":"Schoisswohl","sequence":"additional","affiliation":[]},{"given":"Kate","family":"Smith-Miles","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,10]]},"reference":[{"issue":"1","key":"701_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10479-012-1081-x","volume":"218","author":"RA Ach\u00e1","year":"2014","unstructured":"Ach\u00e1, R. A., & Nieuwenhuis, R. (2014). Curriculum-based course timetabling with sat and maxsat. Annals of Operations Research, 218(1), 71\u201391.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"701_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-018-2757-7","volume":"275","author":"M Banbara","year":"2019","unstructured":"Banbara, M., Inoue, K., Kaufmann, B., Okimoto, T., Schaub, T., Soh, T., et al. (2019). Teaspoon: Solving the curriculum-based course timetabling problems with answer set programming. Annals of Operations Research, 275(1), 3\u201337.","journal-title":"Annals of Operations Research"},{"key":"701_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2015.07.002","volume":"65","author":"R Bellio","year":"2016","unstructured":"Bellio, R., Ceschia, S., Di Gaspero, L., Schaerf, A., & Urli, T. (2016). Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Computers and Operations Research, 65, 83\u201392.","journal-title":"Computers and Operations Research"},{"key":"701_CR4","doi-asserted-by":"crossref","unstructured":"Berg, J., Demirovic, E., & Stuckey, P.J. (2019). Core-boosted linear search for incomplete maxsat. In Integration of constraint programming, artificial intelligence, and operations research - 16th international conference, CPAIOR 2019, Thessaloniki, Greece, June 4\u20137, 2019, Proceedings, pp. 39\u201356.","DOI":"10.1007\/978-3-030-19212-9_3"},{"issue":"1","key":"701_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10479-010-0707-0","volume":"194","author":"A Bonutti","year":"2012","unstructured":"Bonutti, A., De Cesco, F., Di Gaspero, L., & Schaerf, A. (2012). Benchmarking curriculum-based course timetabling: formulations, data formats, instances, validation, visualization, and results. Annals of Operations Research, 194(1), 59\u201370.","journal-title":"Annals of Operations Research"},{"key":"701_CR6","doi-asserted-by":"crossref","unstructured":"Burke, E. K., Causmaecker, D., & Patrick, S. (Eds.). (2003). Practice and theory of automated timetabling iv, 4th international conference, PATAT 2002, Gent, Belgium, August 21\u201323, 2002, selected revised papers. Lecture Notes in Computer Science (Vol. 2740). Springer.","DOI":"10.1007\/b11828"},{"key":"701_CR7","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-540-77903-2_63","volume-title":"Operations Research Proceedings 2007","author":"EK Burke","year":"2008","unstructured":"Burke, E. K., Mare\u010dek, J., Parkes, A. J., & Rudov\u00e1, H. (2008). Penalising patterns in timetables: Novel integer programming formulations. In J. Kalcsics & S. Nickel (Eds.), Operations Research Proceedings 2007 (pp. 409\u2013414). Heidelberg: Berlin."},{"key":"701_CR8","unstructured":"Chiarandini, M., & St\u00fctzle, T. (2003). Experimental evaluation of course timetabling algorithms. fachgebiet intellektik at tu darmstadt.,03,"},{"key":"701_CR9","doi-asserted-by":"crossref","unstructured":"Coello\u00a0C., Carlos A., editor. (2011). Learning and intelligent optimization - 5th international conference, LION 5, Rome, Italy, January 17\u201321, 2011. Selected Papers, volume 6683 of Lecture notes in computer science. Springer, Berlin","DOI":"10.1007\/978-3-642-25566-3"},{"key":"701_CR10","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.04.001","volume":"187","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaufmann, B., & Schaub, T. (2012). Conflict-driven answer set solving: From theory to practice. Artificial Intelligence, 187, 52\u201389.","journal-title":"Artificial Intelligence"},{"key":"701_CR11","unstructured":"Gottlieb, J., & Raidl, G.R., (eds.) (2004). Evolutionary computation in combinatorial optimization, 4th european conference, EvoCOP 2004, Coimbra, Portugal, April 5\u20137, 2004, Proceedings, volume 3004 of Lecture notes in computer science. Springer, Berlin"},{"issue":"4\u20135","key":"701_CR12","first-page":"569","volume":"14","author":"HH Hoos","year":"2014","unstructured":"Hoos, H. H., Lindauer, M. T., & Schaub, T. (2014). claspfolio 2: Advances in algorithm selection for answer set programming. TPLP, 14(4\u20135), 569\u2013585.","journal-title":"TPLP"},{"key":"701_CR13","doi-asserted-by":"crossref","unstructured":"Kostuch, P., & Socha, K. (2004). Hardness prediction for the university course timetabling problem. In Evolutionary computation in combinatorial optimization, 4th European conference, EvoCOP 2004, Coimbra, Portugal, April 5\u20137, 2004, Proceedings, pp. 135\u2013144.","DOI":"10.1007\/978-3-540-24652-7_14"},{"key":"701_CR14","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"X Lin","year":"2008","unstructured":"Lin, X., Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2008). Satzilla: Portfolio-based algorithm selection for SAT. The Journal of Artificial Intelligence Research, 32, 565\u2013606.","journal-title":"The Journal of Artificial Intelligence Research"},{"key":"701_CR15","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-13800-3_31","volume-title":"Learning and intelligent optimization","author":"L Lopes","year":"2010","unstructured":"Lopes, L., & Smith-Miles, K. (2010). Pitfalls in instance generation for udine timetabling. In C. Blum & R. Battiti (Eds.), Learning and intelligent optimization (pp. 299\u2013302). Heidelberg: Berlin."},{"key":"701_CR16","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1287\/opre.2013.1169","volume":"61","author":"L Lopes","year":"2013","unstructured":"Lopes, L., & Smith-Miles, K. (2013). Generating applicable synthetic instances for branch problems. Operations Research, 61, 563\u2013577.","journal-title":"Operations Research"},{"issue":"1","key":"701_CR17","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., et al. (2010). Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing, 22(1), 120\u2013130.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"701_CR18","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1162\/evco_a_00194","volume":"25","author":"MA Mu\u00f1oz","year":"2017","unstructured":"Mu\u00f1oz, M. A., & Smith-Miles, K. A. (2017). Performance analysis of continuous black-box optimization algorithms via footprints in instance space. Evolutionary Computation, 25(4), 529\u2013554.","journal-title":"Evolutionary Computation"},{"issue":"1","key":"701_CR19","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s10994-017-5629-5","volume":"107","author":"MA Mu\u00f1oz","year":"2018","unstructured":"Mu\u00f1oz, M. A., Villanova, L., Baatar, D., & Smith-Miles, K. (2018). Instance spaces for machine learning classification. Machine Learning, 107(1), 109\u2013147.","journal-title":"Machine Learning"},{"key":"701_CR20","doi-asserted-by":"crossref","unstructured":"Musliu, N., Schwengerer, M. (2013). Algorithm selection for the graph coloring problem. In Learning and intelligent optimization - 7th international conference, LION 7, Catania, Italy, January 7\u201311, 2013, Revised Selected Papers, pp. 389\u2013403.","DOI":"10.1007\/978-3-642-44973-4_42"},{"issue":"1","key":"701_CR21","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T M\u00fcller","year":"2009","unstructured":"M\u00fcller, T. (2009). Itc 2007 solver description: A hybrid approach. Annals of Operations Research, 172(1), 429\u2013446.","journal-title":"Annals of Operations Research"},{"key":"701_CR22","doi-asserted-by":"crossref","unstructured":"Nicosia, G., & Pardalos, P.M. (eds.). (2013). Learning and intelligent optimization - 7th international conference, LION 7, Catania, Italy, January 7\u201311, 2013, Revised Selected Papers, volume 7997 of Lecture Notes in Computer Science. Springer, Berlin","DOI":"10.1007\/978-3-642-44973-4"},{"key":"701_CR23","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., et al. (2011). Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12, 2825\u20132830."},{"key":"701_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"JR Rice","year":"1976","unstructured":"Rice, J. R. (1976). The algorithm selection problem. Advances in Computers, 15, 65\u2013118.","journal-title":"Advances in Computers"},{"key":"701_CR25","doi-asserted-by":"crossref","unstructured":"Rossi-Doria, O., Sampels, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L.M., Knowles, J.D., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., & St\u00fctzle, T. (2002). A comparison of the performance of different metaheuristics on the timetabling problem. In Practice and theory of automated timetabling iv, 4th international conference, PATAT 2002, Gent, Belgium, August 21\u201323, 2002, Selected Revised Papers, pp. 329\u2013354.","DOI":"10.1007\/978-3-540-45157-0_22"},{"key":"701_CR26","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"K Smith-Miles","year":"2014","unstructured":"Smith-Miles, K., Baatar, D., Wreford, B., & Lewis, R. (2014). Towards objective measures of algorithm performance across instance space. Computers and Operations Research, 45, 12\u201324.","journal-title":"Computers and Operations Research"},{"key":"701_CR27","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.cor.2015.04.022","volume":"63","author":"K Smith-Miles","year":"2015","unstructured":"Smith-Miles, K., & Bowly, S. (2015). Generating new test instances by evolving in instance space. Computers and Operations Research, 63, 102\u2013113.","journal-title":"Computers and Operations Research"},{"issue":"5","key":"701_CR28","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., & Lopes, L. (2012). Measuring instance difficulty for combinatorial optimization problems. Computers and Operations Research, 39(5), 875\u2013889.","journal-title":"Computers and Operations Research"},{"key":"701_CR29","first-page":"3446","volume":"12","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., & Tan, T. T. (2012). Measuring algorithm footprints in instance space. IEEE CEC, 12, 3446\u20133453.","journal-title":"IEEE CEC"},{"key":"701_CR30","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10472-011-9230-5","volume":"61","author":"K Smith-Miles","year":"2011","unstructured":"Smith-Miles, K., & van Hemert, J. (2011). Discovering the suitability of optimisation algorithms by learning from evolved instances. Annals of Mathematics and Artificial Intelligence, 61, 87\u2013104.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"701_CR31","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/1456650.1456656","volume":"41","author":"KA Smith-Miles","year":"2009","unstructured":"Smith-Miles, K. A. (2009). Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Computing Survey, 41(1), 6:1\u20136:25.","journal-title":"ACM Computing Survey"},{"key":"701_CR32","doi-asserted-by":"crossref","unstructured":"Smith-Miles, K., & Lopes, L. (2011). Generalising algorithm performance in instance space: A timetabling case study. In Learning and intelligent optimization - 5th international conference, LION 5, Rome, Italy, January 17\u201321, 2011. Selected Papers, pp. 524\u2013538.","DOI":"10.1007\/978-3-642-25566-3_41"},{"issue":"5","key":"701_CR33","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2011.07.006","volume":"39","author":"K Smith-Miles","year":"2012","unstructured":"Smith-Miles, K., & Lopes, L. (2012). Measuring instance difficulty for combinatorial optimization problems. Computers and OR, 39(5), 875\u2013889.","journal-title":"Computers and OR"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00701-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-021-00701-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00701-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T06:05:25Z","timestamp":1646201125000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-021-00701-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,10]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["701"],"URL":"https:\/\/doi.org\/10.1007\/s10951-021-00701-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2021,9,10]]},"assertion":[{"value":"1 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}