{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:43:54Z","timestamp":1743101034481,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030648428"},{"type":"electronic","value":"9783030648435"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64843-5_12","type":"book-chapter","created":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:04:24Z","timestamp":1607097864000},"page":"168-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Scheduling with a Shared Resource via Structural Insights"],"prefix":"10.1007","author":[{"given":"Christoph","family":"Damerius","sequence":"first","affiliation":[]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[]},{"given":"Florian","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Ruilong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,12,4]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10951-017-0518-0","volume":"21","author":"E Althaus","year":"2017","unstructured":"Althaus, E., et al.: Scheduling shared continuous resources on many-cores. J. Sched. 21(1), 77\u201392 (2017). https:\/\/doi.org\/10.1007\/s10951-017-0518-0","journal-title":"J. Sched."},{"issue":"6","key":"12_CR2","doi-asserted-by":"publisher","first-page":"3121","DOI":"10.1137\/090767613","volume":"20","author":"L Epstein","year":"2010","unstructured":"Epstein, L., Levin, A.: AFPTAS results for common variants of bin packing: a new method for handling the small items. SIAM J. Optim. 20(6), 3121\u20133145 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"12_CR3","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/s00453-010-9445-6","volume":"62","author":"L Epstein","year":"2012","unstructured":"Epstein, L., Levin, A., van Stee, R.: Approximation schemes for packing splittable items with cardinality constraints. Algorithmica 62(1\u20132), 102\u2013129 (2012)","journal-title":"Algorithmica"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0204015","volume":"4","author":"MR Garey","year":"1975","unstructured":"Garey, M.R., Graham, R.L.: Bounds for multiprocessor scheduling with resource constraints. SIAM J. Comput. 4(2), 187\u2013200 (1975)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"12_CR5","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":"12_CR6","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":"12_CR7","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":"12_CR8","doi-asserted-by":"crossref","unstructured":"Jansen, K., Maack, M., Rau, M.: Approximation schemes for machine scheduling with resource (in-)dependent processing times. ACM Trans. Algorithms 15(3), 31:1\u201331:28 (2019)","DOI":"10.1145\/3302250"},{"issue":"2","key":"12_CR9","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)","journal-title":"Oper. Res. Lett."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Kling, P., M\u00e4cker, A., Riechers, S., Skopalik, A.: Sharing is caring: multiprocessor scheduling with a sharable resource. In: Scheideler, C., Hajiaghayi, M.T. (eds.) Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2017, Washington DC, USA, 24\u201326 July 2017, pp. 123\u2013132. ACM (2017)","DOI":"10.1145\/3087556.3087578"},{"key":"12_CR11","unstructured":"Leung, J.Y. (ed.): Handbook of Scheduling - Algorithms, Models, and Performance Analysis. Chapman and Hall\/CRC (2004)"},{"issue":"4","key":"12_CR12","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)","journal-title":"Algorithmica"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"R\u00f3zycki, R., Weglarz, J.: Improving the efficiency of scheduling jobs driven by a common limited energy source. In: 23rd International Conference on Methods & Models in Automation & Robotics, MMAR 2018, Mi\u0119dzyzdroje, Poland, 27\u201330 August 2018, pp. 932\u2013936. IEEE (2018)","DOI":"10.1109\/MMAR.2018.8486126"},{"key":"12_CR14","unstructured":"Trinitis, C., Weidendorfer, J., Brinkmann, A.: Co-scheduling: prospects and challenges. In: Trinitis, C., Weidendorfer, J. (eds.) Co-Scheduling of HPC Applications [Extended Versions of All Papers from COSH@HiPEAC 2016, Prague, Czech Republic, 19 January 2016]. Advances in Parallel Computing, vol. 28, pp. 1\u201311. IOS Press (2016)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64843-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,4]],"date-time":"2020-12-04T16:53:22Z","timestamp":1607100802000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64843-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030648428","9783030648435"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64843-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 December 2020","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":"Dallas, TX","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"104","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":"55","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":"53% - 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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the Corona pandemic this event was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}