{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T15:40:06Z","timestamp":1756482006535,"version":"3.44.0"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"3","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Evol. Learn. Optim."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"<jats:p>The algorithm selection problem aims to identify the most suitable algorithm for a given problem instance under specific time constraints, where suitability typically refers to a performance metric such as algorithm runtime. While previous work has employed machine learning techniques to tackle this challenge, methods from survival analysis have proven particularly effective. This article presents RunAndSchedule2Survive to address the more general and complex problem of algorithm scheduling, where the objective is to allocate computational resources across multiple algorithms to maximize performance within specified time constraints. Our approach combines survival analysis with evolutionary algorithms to optimize algorithm schedules by leveraging runtime distributions modeled as survival functions. Experimental results across various standard benchmarks demonstrate that our approach significantly outperforms previous methods for algorithm scheduling and yields more robust results than its algorithm selection variant. More specifically, RunAndSchedule2Survive achieves superior performance in 20 out of 25 benchmark scenarios, surpassing hitherto state-of-the-art approaches.<\/jats:p>","DOI":"10.1145\/3737705","type":"journal-article","created":{"date-parts":[[2025,6,9]],"date-time":"2025-06-09T08:20:48Z","timestamp":1749457248000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["RunAndSchedule2Survive: Algorithm Scheduling Based on Run2Survive"],"prefix":"10.1145","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5026-044X","authenticated-orcid":false,"given":"Valentin","family":"Margraf","sequence":"first","affiliation":[{"name":"MCML, LMU Munich, Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-2296-066X","authenticated-orcid":false,"given":"Tom","family":"Koerner","sequence":"additional","affiliation":[{"name":"LMU Munich, Munich, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2415-2186","authenticated-orcid":false,"given":"Alexander","family":"Tornede","sequence":"additional","affiliation":[{"name":"Beckhoff Automation GmbH und Co KG, Verl, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9782-6818","authenticated-orcid":false,"given":"Marcel","family":"Wever","sequence":"additional","affiliation":[{"name":"L3S Research Center, Leibniz University Hannover, Hannover, Germany"}]}],"member":"320","published-online":{"date-parts":[[2025,8,29]]},"reference":[{"key":"e_1_3_2_2_1","doi-asserted-by":"crossref","unstructured":"Roberto Amadini Maurizio Gabbrielli and Jacopo Mauro. 2014. SUNNY: A lazy portfolio approach for constraint solving. Theory and Practice of Logic Programming 14 4\u20135 (2014) 509\u2013524.","DOI":"10.1017\/S1471068414000179"},{"key":"e_1_3_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1875218"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2016.04.003"},{"key":"e_1_3_2_5_1","volume-title":"Classification and Regression Trees","author":"Breiman Leo","year":"1984","unstructured":"Leo Breiman, J. H. Friedman, Richard A. Olshen, and C. J. Stone. 1984. Classification and Regression Trees. Wadsworth, New York, USA."},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"e_1_3_2_8_1","doi-asserted-by":"crossref","unstructured":"Matteo Gagliolo and J\u00fcrgen Schmidhuber. 2006. Learning dynamic algorithm portfolios. Annals of Mathematics and Artificial Intelligence 47 3\u20134 (2006) 295\u2013328.","DOI":"10.1007\/s10472-006-9036-z"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(00)00081-3"},{"key":"e_1_3_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017434"},{"key":"e_1_3_2_11_1","first-page":"176","volume-title":"Technical Communications of the 28th International Conference on Logic Programming (ICLP)LIPIcs","volume":"17","author":"Hoos Holger H.","year":"2012","unstructured":"Holger H. Hoos, Roland Kaminski, Torsten Schaub, and Marius Schneider. 2012. Aspeed: ASP-based solver scheduling. In Technical Communications of the 28th International Conference on Logic Programming (ICLP). LIPIcs, Vol. 17, Schloss Dagstuhl\u2014Leibniz-Zentrum f\u00fcr Informatik, 176\u2013187."},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOAS169"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23786-7_35"},{"key":"e_1_3_2_14_1","first-page":"751","volume-title":"19th European Conference on Artificial Intelligence (ECAI \u201910)Frontiers in Artificial Intelligence and Applications","volume":"215","author":"Kadioglu Serdar","year":"2010","unstructured":"Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, and Tierney Kevin. 2010. ISAC\u2014Instance-specific algorithm configuration. In 19th European Conference on Artificial Intelligence (ECAI \u201910). Frontiers in Artificial Intelligence and Applications, Vol. 215, IOS Press, 751\u2013756."},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00242"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29150-4"},{"key":"e_1_3_2_17_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v35i3.2460"},{"key":"e_1_3_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50349-3_20"},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4726"},{"key":"e_1_3_2_20_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13116"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21581-0_33"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33558-7_38"},{"key":"e_1_3_2_23_1","doi-asserted-by":"crossref","unstructured":"John R. Rice. 1976. The algorithm selection problem. Advances in Computers 15 (1976) 65\u2013118.","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-5040-0_2"},{"key":"e_1_3_2_25_1","first-page":"1197","volume-title":"22nd AAAI Conference on Artificial Intelligence","author":"Streeter Matthew J.","year":"2007","unstructured":"Matthew J. Streeter, Daniel Golovin, and Stephen F. Smith. 2007. Combining multiple heuristics online. In 22nd AAAI Conference on Artificial Intelligence. AAAI Press, 1197\u20131203."},{"key":"e_1_3_2_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-022-06161-4"},{"key":"e_1_3_2_27_1","series-title":"Proceedings of Machine Learning Research","first-page":"737","volume-title":"12th Asian Conference on Machine Learning (ACML)","volume":"129","author":"Tornede Alexander","year":"2020","unstructured":"Alexander Tornede, Marcel Wever, Stefan Werner, Felix Mohr, and Eyke H\u00fcllermeier. 2020. Run2Survive: A decision-theoretic approach to algorithm selection based on survival analysis. In 12th Asian Conference on Machine Learning (ACML). Proceedings of Machine Learning Research, Vol. 129, PMLR, 737\u2013752."},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622673.1622687"}],"container-title":["ACM Transactions on Evolutionary Learning and Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3737705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T15:22:55Z","timestamp":1756480975000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3737705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,29]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3737705"],"URL":"https:\/\/doi.org\/10.1145\/3737705","relation":{},"ISSN":["2688-3007"],"issn-type":[{"type":"electronic","value":"2688-3007"}],"subject":[],"published":{"date-parts":[[2025,8,29]]},"assertion":[{"value":"2024-01-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-11","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-29","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}