{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:30:08Z","timestamp":1760711408850,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031695766"},{"type":"electronic","value":"9783031695773"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-69577-3_16","type":"book-chapter","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T19:02:05Z","timestamp":1724612525000},"page":"225-238","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A $$1.25(1+\\epsilon )$$-Approximation Algorithm for\u00a0Scheduling with\u00a0Rejection Costs Proportional to\u00a0Processing Times"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2741-6228","authenticated-orcid":false,"given":"Olivier","family":"Beaumont","sequence":"first","affiliation":[]},{"given":"R\u00e9mi","family":"Bouzel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2475-3309","authenticated-orcid":false,"given":"Lionel","family":"Eyraud-Dubois","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2880-8228","authenticated-orcid":false,"given":"Esragul","family":"Korkmaz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0997-586X","authenticated-orcid":false,"given":"Laercio","family":"Pilla","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Van Kempen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,26]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L.: Multiprocessor scheduling with rejection. SIAM J. Discret. Math. 13(1), 64\u201378 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Beaumont, O., Bouzel, R., Eyraud-Dubois, L., Korkmaz, E., Pilla, L., Van\u00a0Kempen, A.: Artifact of the paper: A 1.25(1+$$\\epsilon $$)-Approximation Algorithm for Scheduling with Rejection Costs Proportional to Processing Times (2024). https:\/\/doi.org\/10.5281\/zenodo.11580038","DOI":"10.5281\/zenodo.11580038"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Bouzel, R., Ngoko, Y., Benoit, P., Sainth\u00e9rant, N.: Distributed grid computing manager covering waste heat reuse constraints. In: 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 294\u2013299. IEEE (2021)","DOI":"10.23919\/DATE51398.2021.9474164"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1022584312032","volume":"9","author":"A Caprara","year":"2003","unstructured":"Caprara, A., Kellerer, H., Pferschy, U.: A 3\/4-approximation algorithm for multiple subset sum. J. Heuristics 9(2), 99\u2013111 (2003)","journal-title":"J. Heuristics"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Cesaret, B., O\u011fuz, C., Sibel Salman, F.: A tabu search algorithm for order acceptance and scheduling. Comput. Oper. Res. 39(6), 1197\u20131205 (2012). Special Issue on Scheduling in Manufacturing Systems","DOI":"10.1016\/j.cor.2010.09.018"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/3-540-68530-8_41","volume-title":"Algorithms \u2014 ESA\u2019 98","author":"DW Engels","year":"1998","unstructured":"Engels, D.W., Karger, D.R., Kolliopoulos, S.G., Sengupta, S., Uma, R.N., Wein, J.: Techniques for scheduling with rejection. In: Bilardi, G., Italiano, G.F., Pietracaprina, A., Pucci, G. (eds.) ESA 1998. LNCS, vol. 1461, pp. 490\u2013501. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-68530-8_41"},{"issue":"6","key":"16_CR7","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0167-6377(02)00160-8","volume":"30","author":"L Epstein","year":"2002","unstructured":"Epstein, L., Noga, J., Woeginger, G.J.: On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper. Res. Lett. 30(6), 415\u2013420 (2002)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1007\/s10878-020-00642-9","volume":"40","author":"P Liu","year":"2020","unstructured":"Liu, P., Lu, X.: New approximation algorithms for machine scheduling with rejection on single and parallel machine. J. Comb. Optim. 40(4), 929\u2013952 (2020)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"16_CR9","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1016\/j.orl.2020.06.006","volume":"48","author":"Z Liu","year":"2020","unstructured":"Liu, Z.: Scheduling with partial rejection. Oper. Res. Lett. 48(4), 524\u2013529 (2020)","journal-title":"Oper. Res. Lett."},{"key":"16_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2022.108168","volume":"169","author":"B Mor","year":"2022","unstructured":"Mor, B., Shabtay, D.: Single-machine scheduling with total late work and job rejection. Comput. Ind. Eng. 169, 108168 (2022)","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou, J., Zhong, X., Wang, G.: An improved heuristic for parallel machine scheduling with rejection. Eur. J. Oper. Res. 241(3), 653\u2013661 (2015)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., Kaspi, M.: A survey on offline scheduling with rejection. J. Sched. 16, 3\u201328 (2013)","journal-title":"J. Sched."},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick, S.A.: Order acceptance and scheduling: a taxonomy and review. Eur. J. Oper. Res. 212(1), 1\u201311 (2011)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2024: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-69577-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T19:07:11Z","timestamp":1724612831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-69577-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031695766","9783031695773"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-69577-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"26 August 2024","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":"Madrid","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":"26 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}