{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:45:16Z","timestamp":1757627116760,"version":"3.44.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031998539"},{"type":"electronic","value":"9783031998546"}],"license":[{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-99854-6_9","type":"book-chapter","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T05:09:18Z","timestamp":1756184958000},"page":"131-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Bounds for\u00a0SLACK on\u00a0Identical Parallel Machines"],"prefix":"10.1007","author":[{"given":"Louis-Claude","family":"Canon","sequence":"first","affiliation":[]},{"given":"Anthony","family":"Dugois","sequence":"additional","affiliation":[]},{"given":"Pierre-Cyrille","family":"H\u00e9am","sequence":"additional","affiliation":[]},{"given":"Isma\u00ebl","family":"Jecker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Benoit, A., Canon, L., Elghazi, R., H\u00e9am, P.: Asymptotic performance and energy consumption of SLACK. In: Euro-Par 2023. Lecture Notes in Computer Science, vol. 14100, pp. 81\u201395 (2023)","DOI":"10.1007\/978-3-031-39698-4_6"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10951-018-0597-6","volume":"23","author":"F Della Croce","year":"2020","unstructured":"Della Croce, F., Scatamacchia, R.: The longest processing time rule for identical parallel machines revisited. J. Sched. 23(2), 163\u2013176 (2020)","journal-title":"J. Sched."},{"issue":"3","key":"9_CR3","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: \u201cStrong\u2019\u2019 NP-completeness results: motivation, examples, and implications. J. ACM 25(3), 499\u2013508 (1978)","journal-title":"J. ACM"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. J. SIAM Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"J. SIAM Appl. Math."},{"issue":"1","key":"9_CR5","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"DS Hochbaum","year":"1987","unstructured":"Hochbaum, D.S., Shmoys, D.B.: Using dual approximation algorithms for scheduling problems theoretical and practical results. J. ACM (JACM) 34(1), 144\u2013162 (1987)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1287\/moor.2019.1036","volume":"45","author":"K Jansen","year":"2020","unstructured":"Jansen, K., Klein, K., Verschae, J.: Closing the gap for makespan scheduling via sparsification techniques. Math. Oper. Res. 45(4), 1371\u20131392 (2020)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"9_CR7","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10951-022-00742-w","volume":"25","author":"M Lee","year":"2022","unstructured":"Lee, M., Lee, K., Pinedo, M.: Tight approximation bounds for the LPT rule applied to identical parallel machines with small jobs. J. Sched. 25(6), 721\u2013740 (2022)","journal-title":"J. Sched."},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1016\/S0377-2217(02)00726-9","volume":"152","author":"E Mokotoff","year":"2004","unstructured":"Mokotoff, E.: An exact algorithm for the identical parallel machine scheduling problem. Eur. J. Oper. Res. 152(3), 758\u2013769 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"5300","DOI":"10.1109\/ACCESS.2018.2789678","volume":"6","author":"M Mrad","year":"2018","unstructured":"Mrad, M., Souayah, N.: An arc-flow model for the makespan minimization problem on identical parallel machines. IEEE Access 6, 5300\u20135307 (2018)","journal-title":"IEEE Access"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Ostojic, D., Davidovic, T., Kr\u00fcger, T.J., Ramljak, D.: Comparative analysis of heuristic approaches to P$$\\vert $$Cmax. In: ICORES 2022, pp. 259\u2013266 (2022)","DOI":"10.5220\/0011008500003117"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10852-014-9262-z","volume":"14","author":"G Paletta","year":"2015","unstructured":"Paletta, G., Ruiz-Torres, A.J.: Partial solutions and multifit algorithm for multiprocessor scheduling. J. Math. Model. Algorithms Oper. Res. 14(2), 125\u2013143 (2015)","journal-title":"J. Math. Model. Algorithms Oper. Res."},{"issue":"2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1023\/A:1009625629722","volume":"4","author":"A Thesen","year":"1998","unstructured":"Thesen, A.: Design and evaluation of tabu search algorithms for multiprocessor scheduling. J. Heuristics 4(2), 141\u2013160 (1998)","journal-title":"J. Heuristics"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2025: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99854-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:33:13Z","timestamp":1757464393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99854-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"ISBN":["9783031998539","9783031998546"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99854-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,27]]},"assertion":[{"value":"27 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}