{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:11:42Z","timestamp":1742915502234,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031125966"},{"type":"electronic","value":"9783031125973"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-12597-3_16","type":"book-chapter","created":{"date-parts":[[2022,7,31]],"date-time":"2022-07-31T10:02:21Z","timestamp":1659261741000},"page":"253-267","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Two-Agent Scheduling with\u00a0Resource Augmentation on\u00a0Multiple Machines"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5347-5729","authenticated-orcid":false,"given":"Vincent","family":"Fagnon","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7368-355X","authenticated-orcid":false,"given":"Giorgio","family":"Lucarelli","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9566-5085","authenticated-orcid":false,"given":"Cl\u00e9ment","family":"Mommessin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2623-6922","authenticated-orcid":false,"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,8,1]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent Scheduling","author":"A Agnetis","year":"2014","unstructured":"Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., Soukhal, A.: Multiagent Scheduling. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-41880-8"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1287\/opre.1030.0092","volume":"52","author":"A Agnetis","year":"2004","unstructured":"Agnetis, A., Mirchandani, P.B., Pacciarelli, D., Pacifici, A.: Scheduling problems with two competing agents. Oper. Res. 52(2), 229\u2013242 (2004)","journal-title":"Oper. Res."},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10951-014-0414-9","volume":"18","author":"A Agnetis","year":"2015","unstructured":"Agnetis, A., Nicosia, G., Pacifici, A., Pferschy, U.: Scheduling two agent task chains with a central selection mechanism. J. Sched. 18(3), 243\u2013261 (2015). https:\/\/doi.org\/10.1007\/s10951-014-0414-9","journal-title":"J. Sched."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Anand, S., Garg, N., Kumar, A.: Resource augmentation for weighted flow-time explained by dual fitting. In: Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms, pp. 1228\u20131241. SIAM (2012)","DOI":"10.1137\/1.9781611973099.97"},{"key":"16_CR5","unstructured":"Anderson, D.P.: BOINC: a system for public-resource computing and storage. In: Proceedings of the 5th IEEE\/ACM International Workshop on Grid Computing, pp. 4\u201310. IEEE Computer Society (2004)"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"KR Baker","year":"2003","unstructured":"Baker, K.R., Smith, J.C.: A multiple-criterion model for machine scheduling. J. Sched. 6(1), 7\u201316 (2003)","journal-title":"J. Sched."},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Khanna, S., Zhu, A.: Algorithms for minimizing weighted flow time. In: Proceedings of the 33rd ACM Symposium on Theory of Computing, pp. 84\u201393 (2001)","DOI":"10.1145\/380752.380778"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"98702","DOI":"10.1109\/ACCESS.2019.2929582","volume":"7","author":"C Cheng","year":"2019","unstructured":"Cheng, C., Li, S., Ying, K., Liu, Y.: Scheduling jobs of two competing agents on a single machine. IEEE Access 7, 98702\u201398714 (2019)","journal-title":"IEEE Access"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.jcss.2017.07.006","volume":"91","author":"AR Choudhury","year":"2018","unstructured":"Choudhury, A.R., Das, S., Garg, N., Kumar, A.: Rejecting jobs to minimize load and maximum flow-time. J. Comput. Syst. Sci. 91, 42\u201368 (2018)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"16_CR10","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(90)90100-V","volume":"75","author":"J Du","year":"1990","unstructured":"Du, J., Leung, J.Y.T., Young, G.H.: Minimizing mean flow time with release time constraint. Theoret. Comput. Sci. 75(3), 347\u2013355 (1990)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"16_CR11","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1016\/j.apm.2014.07.024","volume":"39","author":"Q Feng","year":"2015","unstructured":"Feng, Q., Fan, B., Li, S., Shang, W.: Two-agent scheduling with rejection on a single machine. Appl. Math. Model. 39(3), 1183\u20131193 (2015)","journal-title":"Appl. Math. Model."},{"issue":"4","key":"16_CR12","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617\u2013643 (2000)","journal-title":"J. ACM"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/S0097539796305778","volume":"28","author":"H Kellerer","year":"1999","unstructured":"Kellerer, H., Tautenhahn, T., Woeginger, G.: Approximability and nonapproximability results for minimizing total flow time on a single machine. SIAM J. Comput. 28(4), 1155\u20131166 (1999)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"16_CR14","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.jcss.2006.10.018","volume":"73","author":"S Leonardi","year":"2007","unstructured":"Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. J. Comput. Syst. Sci. 73(6), 875\u2013891 (2007)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/s10878-015-9902-x","volume":"32","author":"S-S Li","year":"2015","unstructured":"Li, S.-S., Chen, R.-X., Feng, Q.: Scheduling two job families on a single machine with two competitive agents. J. Comb. Optim. 32(3), 784\u2013799 (2015). https:\/\/doi.org\/10.1007\/s10878-015-9902-x","journal-title":"J. Comb. Optim."},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.cor.2019.06.004","volume":"111","author":"P Liu","year":"2019","unstructured":"Liu, P., Gu, M., Li, G.: Two-agent scheduling on a single machine with release dates. Comput. Oper. Res. 111, 35\u201342 (2019)","journal-title":"Comput. Oper. Res."},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"Lucarelli, G., Moseley, B., Thang, N.K., Srivastav, A., Trystram, D.: Online non-preemptive scheduling on unrelated machines with rejections. In: Proceedings of the 30th Symposium on Parallelism in Algorithms and Architectures, SPAA, pp. 291\u2013300. ACM (2018)","DOI":"10.1145\/3210377.3210402"},{"key":"16_CR18","unstructured":"Lucarelli, G., Moseley, B., Thang, N.K., Srivastav, A., Trystram, D.: Online non-preemptive scheduling to minimize weighted flow-time on unrelated machines. In: 26th Annual European Symposium on Algorithms, ESA. LIPIcs, vol. 112, pp. 59:1\u201359:12 (2018)"},{"key":"16_CR19","unstructured":"Lucarelli, G., Moseley, B., Thang, N.K., Srivastav, A., Trystram, D.: Online non-preemptive scheduling to minimize maximum weighted flow-time on related machines. In: 39th IARCS Annual Conference on FSTTCS. LIPIcs, vol. 150, pp. 24:1\u201324:12 (2019)"},{"key":"16_CR20","unstructured":"Lucarelli, G., Thang, N.K., Srivastav, A., Trystram, D.: Online non-preemptive scheduling in a resource augmentation model based on duality. In: 24th Annual European Symposium on Algorithms, ESA. LIPIcs, vol. 57, pp. 63:1\u201363:17 (2016)"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"1622","DOI":"10.1109\/COMST.2021.3075439","volume":"23","author":"DC Nguyen","year":"2021","unstructured":"Nguyen, D.C., Ding, M., Pathirana, P.N., Seneviratne, A., Li, J., Poor, H.V.: Federated learning for internet of things: a comprehensive survey. IEEE Commun. Surv. Tutor. 23, 1622\u20131658 (2021)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. In: Proceedings of the 29th ACM symposium on Theory of Computing, pp. 140\u2013149 (1997)","DOI":"10.1145\/258533.258570"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Saule, E., Trystram, D.: Multi-users scheduling in parallel systems. In: 23rd IEEE International Symposium on Parallel and Distributed Processing, (IPDPS), pp. 1\u20139 (2009)","DOI":"10.1109\/IPDPS.2009.5161037"},{"key":"16_CR24","series-title":"Uncertainty and Operations Research","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-15-2105-8","volume-title":"Due Date-Related Scheduling with Two Agents","author":"Y Yin","year":"2020","unstructured":"Yin, Y., Wang, D., Cheng, T.C.E.: Due Date-Related Scheduling with Two Agents. UOR, Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-2105-8"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2022: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-12597-3_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,11]],"date-time":"2022-08-11T23:13:21Z","timestamp":1660259601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-12597-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031125966","9783031125973"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-12597-3_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Glasgow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.euro-par.org\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"102","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":"25","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":"25% - 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.97","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":"4","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)"}}]}}