{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:09:13Z","timestamp":1745467753052,"version":"3.40.4"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031838873","type":"print"},{"value":"9783031838859","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-83885-9_5","type":"book-chapter","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T08:35:00Z","timestamp":1745397300000},"page":"50-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning-Based Algorithm Selection for\u00a0a\u00a0Multiprocessor Scheduling Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4086-229X","authenticated-orcid":false,"given":"Roland","family":"Braune","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,24]]},"reference":[{"key":"5_CR1","unstructured":"Scikit-learn user guide, ensemble methods. https:\/\/scikit-learn.org\/stable\/modules\/ensemble.html. Accessed 31 May 2024"},{"issue":"4","key":"5_CR2","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TC.2006.58","volume":"55","author":"J Blazewicz","year":"2006","unstructured":"Blazewicz, J., Kovalyov, M., Machowiak, M., Trystram, D., Weglarz, J.: Preemptable malleable task scheduling problem. IEEE Trans. Comput. 55(4), 486\u2013490 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0377-2217(96)00126-9","volume":"94","author":"J Blazewicz","year":"1996","unstructured":"Blazewicz, J., Liu, Z.: Scheduling multiprocessor tasks with chain constraints. Eur. J. Oper. Res. 94, 231\u2013241 (1996)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ejor.2018.10.004","volume":"274","author":"R Braune","year":"2019","unstructured":"Braune, R.: Lower bounds for a bin packing problem with linear usage cost. Eur. J. Oper. Res. 274(1), 49\u201364 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.10.004","journal-title":"Eur. J. Oper. Res."},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10951-022-00750-w","volume":"25","author":"R Braune","year":"2022","unstructured":"Braune, R.: Packing-based branch-and-bound for discrete malleable task scheduling. J. Sched. 25, 675\u2013704 (2022). https:\/\/doi.org\/10.1007\/s10951-022-00750-w","journal-title":"J. Sched."},{"issue":"8","key":"5_CR6","doi-asserted-by":"publisher","first-page":"952","DOI":"10.1057\/s41274-017-0239-y","volume":"68","author":"R Braune","year":"2017","unstructured":"Braune, R., Doerner, K.F.: Real-world flexible resource profile scheduling with multiple criteria: learning scalarization functions for MIP and heuristic approaches. J. Oper. Res. Soc. 68(8), 952\u2013972 (2017). https:\/\/doi.org\/10.1057\/s41274-017-0239-y","journal-title":"J. Oper. Res. Soc."},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Bringmann, K.: A near-linear pseudopolynomial time algorithm for subset sum. In: Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1073\u20131084. https:\/\/doi.org\/10.1137\/1.9781611974782.69","DOI":"10.1137\/1.9781611974782.69"},{"key":"5_CR8","volume-title":"Scheduling for Parallel Processing. Computer Communications and Networks","author":"M Drozdowski","year":"2009","unstructured":"Drozdowski, M.: Scheduling for Parallel Processing. Computer Communications and Networks. Springer Verlag, London (2009)"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119\u2013139 (1997). https:\/\/doi.org\/10.1006\/jcss.1997.1504, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S002200009791504X","DOI":"10.1006\/jcss.1997.1504"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Frohner, N., Gmys, J., Melab, N., Raidl, G., Talbi, E.G.: Parallel beam search for combinatorial optimization. In: Workshop Proceedings of the 51st International Conference on Parallel Processing. ICPP Workshops 2022, Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3547276.3548633","DOI":"10.1145\/3547276.3548633"},{"key":"5_CR11","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy\u00a0Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Oper. Res. 5, 187\u2013326 (1979)"},{"key":"5_CR12","unstructured":"Korf, R.E.: An improved algorithm for optimal bin packing. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence, pp. 1252\u20131258. IJCAI 2003, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2003). http:\/\/dl.acm.org\/citation.cfm?id=1630659.1630838"},{"key":"5_CR13","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"S Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons, New York (1990)"},{"key":"5_CR14","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory \u2013 EUROCAST 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-83885-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T08:35:04Z","timestamp":1745397304000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-83885-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031838873","9783031838859"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-83885-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"24 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCAST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Systems Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Las Palmas de Canaria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19th","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocast2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocast2024.fulp.ulpgc.es\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}