{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:21:06Z","timestamp":1740122466126,"version":"3.37.3"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["CRC 901","CRC 901"],"award-info":[{"award-number":["CRC 901","CRC 901"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["CRC 901","CRC 901"],"award-info":[{"award-number":["CRC 901","CRC 901"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10878-018-0325-3","type":"journal-article","created":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T05:12:43Z","timestamp":1531285963000},"page":"1356-1379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling with interjob communication on parallel processors"],"prefix":"10.1007","volume":"36","author":[{"given":"J\u00fcrgen","family":"K\u00f6nig","sequence":"first","affiliation":[]},{"given":"Alexander","family":"M\u00e4cker","sequence":"additional","affiliation":[]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[]},{"given":"S\u00f6ren","family":"Riechers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"issue":"1","key":"325_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10951-017-0518-0","volume":"21","author":"E Althaus","year":"2016","unstructured":"Althaus E, Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Sgall J, S\u00fc\u00df T (2016) Scheduling shared continuous resources on many-cores. J Sched 21(1):77\u201392","journal-title":"J Sched"},{"key":"325_CR2","doi-asserted-by":"crossref","unstructured":"Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, S\u00fc\u00df T (2014) Scheduling shared continuous resources on many-cores. In: Proceedings of the 26th ACM symposium on parallelism in algorithms and architectures (SPAA \u201914). ACM, pp 128\u2013137","DOI":"10.1145\/2612669.2612698"},{"issue":"6","key":"325_CR3","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s00224-006-1249-3","volume":"39","author":"F Chung","year":"2006","unstructured":"Chung F, Graham R, Mao J, Varghese G (2006) Parallelism versus memory allocation in pipelined router forwarding engines. Theory Comput Syst 39(6):829\u2013849","journal-title":"Theory Comput Syst"},{"key":"325_CR4","unstructured":"Collaborative Research Centre 901. On-the-fly-computing. \n                    http:\/\/sfb901.uni-paderborn.de"},{"issue":"4","key":"325_CR5","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"WF Vega de la","year":"1981","unstructured":"de la Vega WF, Lueker GS (1981) Bin packing can be solved within 1+epsilon in linear time. Combinatorica 1(4):349\u2013355","journal-title":"Combinatorica"},{"key":"325_CR6","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2013.09.007","volume":"510","author":"G D\u00f3sa","year":"2013","unstructured":"D\u00f3sa G, Li R, Han X, Tuza Z (2013) Tight absolute bound for First Fit Decreasing bin-packing: FFD(L) \n                    \n                      \n                    \n                    $$\\le $$\n                    \n                      \n                        \u2264\n                      \n                    \n                   11\/9 OPT(L) + 6\/9. Theor Comput Sci 510:13\u201361","journal-title":"Theor Comput Sci"},{"issue":"1\u20132","key":"325_CR7","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 (2012) Approximation schemes for packing splittable items with cardinality constraints. Algorithmica 62(1\u20132):102\u2013129","journal-title":"Algorithmica"},{"key":"325_CR8","unstructured":"Epstein L, Van\u00a0Stee R (2007) Approximation schemes for packing splittable items with cardinality constraints. In: Proceedings of the 5th international workshop on approximation and online algorithms (WAOA \u201905), volume 4927 of LNCS. Springer, pp 232\u2013245"},{"issue":"1","key":"325_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00224-009-9226-2","volume":"48","author":"L Epstein","year":"2011","unstructured":"Epstein L, van Stee R (2011) Improved results for a memory allocation problem. Theory Comput Syst 48(1):79\u201392","journal-title":"Theory Comput Syst"},{"issue":"5&6","key":"325_CR10","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/BF01758774","volume":"7","author":"HN Gabow","year":"1992","unstructured":"Gabow HN, Westermann HH (1992) Forests, frames, and games: algorithms for matroid sums and applications. Algorithmica 7(5&6):465\u2013497","journal-title":"Algorithmica"},{"key":"325_CR11","doi-asserted-by":"crossref","unstructured":"Happe M, Meyer auf der Heide F, Kling P, Platzner M, Plessl C (2013) On-the-fly computing: a novel paradigm for individualized IT services. In: Proceedings of the 16th IEEE international symposium on object\/component\/service-oriented real-time distributed computing (ISORC \u201913). IEEE Computer Society, pp 1\u201310","DOI":"10.1109\/ISORC.2013.6913232"},{"key":"325_CR12","doi-asserted-by":"crossref","unstructured":"Karmarkar N, Karp RM (1982) An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd annual symposium on foundations of computer science (FOCS \u201982). IEEE Computer Society, pp 312\u2013320","DOI":"10.1109\/SFCS.1982.61"},{"key":"325_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-20807-2_25","volume-title":"Integer Programming and Combinatoral Optimization","author":"Tam\u00e1s Kir\u00e1ly","year":"2011","unstructured":"Kir\u00e1ly T, Lau LC (2011) Degree bounded forest covering. In Proceedings of the 15th international conference on integer programming and combinatorial optimization (IPCO \u201911), pp 315\u2013323"},{"issue":"4","key":"325_CR14","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s00224-012-9412-5","volume":"52","author":"JMM Rooij van","year":"2013","unstructured":"van Rooij JMM, van Kooten Niekerk ME, Bodlaender HL (2013) Partition into triangles on bounded degree graphs. Theory Comput Syst 52(4):687\u2013718","journal-title":"Theory Comput Syst"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0325-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0325-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0325-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T12:39:44Z","timestamp":1569155984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0325-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["325"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0325-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"11 July 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}