{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:33:26Z","timestamp":1773246806330,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030856649","type":"print"},{"value":"9783030856656","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-85665-6_7","type":"book-chapter","created":{"date-parts":[[2021,8,28]],"date-time":"2021-08-28T03:06:52Z","timestamp":1630120012000},"page":"105-119","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Fixed-Parameter Algorithm for Scheduling Unit Dependent Tasks with Unit Communication Delays"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1388-8788","authenticated-orcid":false,"given":"Ning","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2170-6366","authenticated-orcid":false,"given":"Alix Munier","family":"Kordon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,25]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-030-29400-7_9","volume-title":"Euro-Par 2019: Parallel Processing","author":"M Ait Aba","year":"2019","unstructured":"Ait Aba, M., Munier Kordon, A., Pallez (Aupy), G.: Scheduling on two unbounded resources with communication costs. In: Yahyapour, R. (ed.) Euro-Par 2019. LNCS, vol. 11725, pp. 117\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29400-7_9"},{"issue":"6","key":"7_CR2","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1007\/s11590-014-0802-2","volume":"11","author":"A Ait El Cadi","year":"2014","unstructured":"Ait El Cadi, A., Ben Atitallah, R., Hanafi, S., Mladenovi\u0107, N., Artiba, A.: New MIP model for multiprocessor scheduling problem with communication delays. Optimization Letters 11(6), 1091\u20131107 (2014). https:\/\/doi.org\/10.1007\/s11590-014-0802-2","journal-title":"Optimization Letters"},{"issue":"2","key":"7_CR3","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1006\/jpdc.1999.1530","volume":"57","author":"T Andronikos","year":"1999","unstructured":"Andronikos, T., Koziris, N., Papakonstantinou, G., Tsanakas, P.: Optimal scheduling for UET\/UET-UCT generalized n-dimensional grid task graphs. J. Parallel Distrib. Comput. 57(2), 140\u2013165 (1999)","journal-title":"J. Parallel Distrib. Comput."},{"key":"7_CR4","first-page":"1","volume":"11","author":"HL Bodlaender","year":"1992","unstructured":"Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybern. 11, 1\u201321 (1992)","journal-title":"Acta Cybern."},{"issue":"2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0377-2217(89)90216-6","volume":"43","author":"P Chr\u00e9tienne","year":"1989","unstructured":"Chr\u00e9tienne, P.: A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints. Eur. J. Oper. Res. 43(2), 225\u2013230 (1989)","journal-title":"Eur. J. Oper. Res."},{"key":"7_CR6","unstructured":"Chr\u00e9tienne, P., Picouleau, C.: Scheduling with communication delays: a survey, pp. 65\u201390 (1995)"},{"key":"7_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"7_CR8","unstructured":"Davidovi\u0107, T., Liberti, L., Maculan, N., Mladenovic, N.: Towards the optimal solution of the multiprocessor scheduling problem with communication delays. In: MISTA Conference (2007)"},{"key":"7_CR9","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. TCS. Springer, London (2013). https:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"7_CR10","doi-asserted-by":"publisher","unstructured":"Drozdowski, M.: Scheduling for Parallel Processing. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-1-84882-310-5","DOI":"10.1007\/978-1-84882-310-5"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Giroudeau, R., Koenig, J.C.: Scheduling with communication delays. In: Levner, E. (ed.) Multiprocessor Scheduling, chap. 4. IntechOpen, Rijeka (2007)","DOI":"10.5772\/5215"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Graham, R.L., Lawler, E., Lenstra, J., Rinnooy Kan, A.: Optimization and approximation in deterministic sequencing and scheduling: a survey. In: Hammer, P., Johnson, E., Korte, B. (eds.) Discrete Optimization II, Annals of Discrete Mathematics, vol. 5, pp. 287\u2013326. Elsevier (1979)","DOI":"10.1016\/S0167-5060(08)70356-X"},{"issue":"3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0167-6377(94)90024-8","volume":"16","author":"J Hoogeveen","year":"1994","unstructured":"Hoogeveen, J., Lenstra, J., Veltman, B.: Three, four, five, six, or the complexity of scheduling with communication delays. Oper. Res. Lett. 16(3), 129\u2013137 (1994)","journal-title":"Oper. Res. Lett."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Mnich, M., Van Bevern, R.: Parameterized complexity of machine scheduling: 15 open problems. Comput. Oper. Res. 100, 254\u2013261 (2018)","DOI":"10.1016\/j.cor.2018.07.020"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2020.11.024","volume":"290","author":"A Munier Kordon","year":"2021","unstructured":"Munier Kordon, A.: A fixed-parameter algorithm for scheduling unit dependent tasks on parallel machines with time windows. Discrete Appl. Math. 290, 1\u20136 (2021)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0167-8191(98)00100-8","volume":"25","author":"RH M\u00f6hring","year":"1999","unstructured":"M\u00f6hring, R.H., Sch\u00e4ffter, M.W.: Scheduling series-parallel orders subject to 0\/1-communication delays. Parallel Comput. 25(1), 23\u201340 (1999)","journal-title":"Parallel Comput."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Orr, M., Sinnen, O.: Optimal task scheduling benefits from a duplicate-free state-space. J. Parallel Distrib. Comput. 146, 158\u2013174 (2020)","DOI":"10.1016\/j.jpdc.2020.07.005"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0166-218X(87)90042-4","volume":"18","author":"V Rayward-Smith","year":"1987","unstructured":"Rayward-Smith, V.: UET scheduling with unit interprocessor communication delays. Discrete Appl. Math. 18(1), 55\u201371 (1987)","journal-title":"Discrete Appl. Math."},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Shimada, K., Taniguchi, I., Tomiyama, H.: Communication-aware scheduling for malleable tasks. In: 2019 International Conference on Platform Technology and Service (PlatCon), pp. 1\u20136 (2019)","DOI":"10.1109\/PlatCon.2019.8669429"},{"key":"7_CR20","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.cor.2013.09.004","volume":"43","author":"O Sinnen","year":"2014","unstructured":"Sinnen, O.: Reducing the solution space of optimal task scheduling. Comput. Oper. Res. 43, 201\u2013214 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"7_CR21","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0167-8191(90)90056-F","volume":"16","author":"B Veltman","year":"1990","unstructured":"Veltman, B., Lageweg, B., Lenstra, J.: Multiprocessor scheduling with communication delays. Parallel Comput. 16(2), 173\u2013182 (1990)","journal-title":"Parallel Comput."},{"key":"7_CR22","unstructured":"Veltman, B.: Multiprocessor scheduling with communication delays. Ph.D. thesis, Eindhoven University of Technology (1993)"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/TPDS.2014.2308175","volume":"26","author":"S Venugopalan","year":"2015","unstructured":"Venugopalan, S., Sinnen, O.: ILP formulations for optimal task scheduling with communication delays on parallel systems. IEEE Trans. Parallel Distrib. Syst. 26(1), 142\u2013151 (2015)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s11081-009-9080-8","volume":"11","author":"Y Zinder","year":"2010","unstructured":"Zinder, Y., Su, B., Singh, G., Sorli, R.: Scheduling UET-UCT tasks: branch-and-bound search in the priority space. Optim. Eng. 11, 627\u2013646 (2010)","journal-title":"Optim. Eng."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2021: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85665-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T22:02:23Z","timestamp":1756332143000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85665-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030856649","9783030856656"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85665-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"25 August 2021","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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2021.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":"136","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":"38","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":"28% - 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":"4","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}