{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:39:29Z","timestamp":1742974769475,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496103"},{"type":"electronic","value":"9783031496110"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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-49611-0_11","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"154-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Scheduling with\u00a0a\u00a0Shared Resource"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Damerius","sequence":"first","affiliation":[]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Schneider","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10951-017-0518-0","volume":"21","author":"E Althaus","year":"2018","unstructured":"Althaus, E., et al.: Scheduling shared continuous resources on many-cores. J. Sched. 21(1), 77\u201392 (2018). https:\/\/doi.org\/10.1007\/s10951-017-0518-0","journal-title":"J. Sched."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.03.021","volume":"678","author":"A Antoniadis","year":"2017","unstructured":"Antoniadis, A., Kling, P., Ott, S., Riechers, S.: Continuous speed scaling with variability: a simple and direct approach. Theor. Comput. Sci. 678, 1\u201313 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Beaumont, O., Bonichon, N., Eyraud-Dubois, L., Marchal, L.: Minimizing weighted mean completion time for malleable tasks scheduling. In: IEEE 26th IPDPS, pp. 273\u2013284 (2012)","DOI":"10.1109\/IPDPS.2012.34"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Chen, D., Wu, J., Liu, P.: Data-bandwidth-aware job scheduling in grid and cluster environments. In: 15th IEEE ICPADS, pp. 414\u2013421 (2009)","DOI":"10.1109\/ICPADS.2009.42"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Damerius, C., Kling, P., Li, M., Schneider, F., Zhang, R.: Improved scheduling with a shared resource via structural insights. In: COCOA, pp. 168\u2013182 (2020)","DOI":"10.1007\/978-3-030-64843-5_12"},{"issue":"2\u20133","key":"11_CR6","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2006.05.012","volume":"361","author":"T Decker","year":"2006","unstructured":"Decker, T., L\u00fccking, T., Monien, B.: A 5\/4-approximation algorithm for scheduling identical malleable tasks. TCS 361(2\u20133), 226\u2013240 (2006)","journal-title":"TCS"},{"issue":"4","key":"11_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1002\/jos.76","volume":"4","author":"M Drozdowski","year":"2001","unstructured":"Drozdowski, M.: New applications of the Muntz and Coffman algorithm. J. Sched. 4(4), 209\u2013223 (2001)","journal-title":"J. Sched."},{"issue":"4","key":"11_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"MR Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4(4), 397\u2013411 (1975)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10107-006-0059-3","volume":"110","author":"A Grigoriev","year":"2007","unstructured":"Grigoriev, A., Sviridenko, M., Uetz, M.: Machine scheduling with resource dependent processing times. Math. Program. 110(1), 209\u2013228 (2007)","journal-title":"Math. Program."},{"issue":"4","key":"11_CR10","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.disopt.2009.05.002","volume":"6","author":"A Grigoriev","year":"2009","unstructured":"Grigoriev, A., Uetz, M.: Scheduling jobs with time-resource tradeoff via nonlinear programming. Discret. Optim. 6(4), 414\u2013419 (2009)","journal-title":"Discret. Optim."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Jansen, K., Maack, M., Rau, M.: Approximation schemes for machine scheduling with resource (in-)dependent processing times. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM SODA, pp. 1526\u20131542 (2016)","DOI":"10.1137\/1.9781611974331.ch104"},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.orl.2007.08.001","volume":"36","author":"H Kellerer","year":"2008","unstructured":"Kellerer, H.: An approximation algorithm for identical parallel machine scheduling with resource dependent processing times. Oper. Res. Lett. 36(2), 157\u2013159 (2008). https:\/\/doi.org\/10.1016\/j.orl.2007.08.001","journal-title":"Oper. Res. Lett."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Kling, P., M\u00e4cker, A., Riechers, S., Skopalik, A.: Sharing is caring: multiprocessor scheduling with a sharable resource. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, pp. 123\u2013132. ACM (2017)","DOI":"10.1145\/3087556.3087578"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Leung, J.Y. (ed.): Handbook of Scheduling - Algorithms, Models, and Performance Analysis. Chapman and Hall\/CRC, Boca Raton (2004). ISBN 978-1-58488-397-5","DOI":"10.1201\/9780203489802"},{"key":"11_CR15","unstructured":"Maack, M., Pukrop, S., Rasmussen, A.R.: (in-)approximability results for interval, resource restricted, and low rank scheduling. In: 30th Annual European Symposium on Algorithms, ESA, LIPIcs, vol. 244, pp. 77:1\u201377:13 (2022)"},{"issue":"4","key":"11_CR16","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s00453-013-9829-5","volume":"71","author":"M Niemeier","year":"2015","unstructured":"Niemeier, M., Wiese, A.: Scheduling with an orthogonal resource constraint. Algorithmica 71(4), 837\u2013858 (2015). https:\/\/doi.org\/10.1007\/s00453-013-9829-5","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49611-0_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:07:26Z","timestamp":1707556046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49611-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496103","9783031496110"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49611-0_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}