{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:26:39Z","timestamp":1743157599084,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487489"},{"type":"electronic","value":"9783319487496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-48749-6_41","type":"book-chapter","created":{"date-parts":[[2016,10,30]],"date-time":"2016-10-30T04:16:59Z","timestamp":1477801019000},"page":"563-577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scheduling with Interjob Communication on Parallel Processors"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"K\u00f6nig","sequence":"first","affiliation":[]},{"given":"Alexander","family":"M\u00e4cker","sequence":"additional","affiliation":[]},{"given":"Friedhelm Meyer auf","family":"der Heide","sequence":"additional","affiliation":[]},{"given":"S\u00f6ren","family":"Riechers","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,31]]},"reference":[{"key":"41_CR1","unstructured":"Collaborative Research Centre 901 - On-The-Fly-Computing. \n                      http:\/\/sfb901.uni-paderborn.de"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Brinkmann, A., Kling, P., auf der Heide, F.M., Nagel, L., Riechers, S., S\u00fc\u00df, T.: Scheduling shared continuous resources on many-cores. In: Proceedings of the 26th ACM Symposium on Parallelism inAlgorithms and Architectures (SPAA 2014), pp. 128\u2013137. ACM (2014)","DOI":"10.1145\/2612669.2612698"},{"issue":"6","key":"41_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.: Parallelism versus memory allocation in pipelined router forwarding engines. Theory Comput. Syst. 39(6), 829\u2013849 (2006)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"41_CR4","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"WF Vega de la","year":"1981","unstructured":"de la Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1+epsilon in linear time. Combinatorica 1(4), 349\u2013355 (1981)","journal-title":"Combinatorica"},{"key":"41_CR5","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.: Tight absolute bound for first fit decreasing bin-packing: FFD(l) \n                      \n                        \n                      \n                      $$\\le $$\n                     11\/9 OPT(L) + 6\/9. Theoret. Comput. Sci. 510, 13\u201361 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"1\u20132","key":"41_CR6","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"},{"key":"41_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-540-77918-6_19","volume-title":"Approximation and Online Algorithms","author":"L Epstein","year":"2008","unstructured":"Epstein, L., van Stee, R.: Approximation schemes for packing splittable items with cardinality constraints. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol. 4927, pp. 232\u2013245. Springer, Heidelberg (2008)"},{"issue":"1","key":"41_CR8","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.: Improved results for a memory allocation problem. Theory Comput. Syst. 48(1), 79\u201392 (2011)","journal-title":"Theory Comput. Syst."},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Happe, M., auf der Heide, F.M., Kling, P., Platzner, M., Plessl, C.: 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 2013), pp. 1\u201310. IEEE Computer Society (2013)","DOI":"10.1109\/ISORC.2013.6913232"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.M.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 312\u2013320. IEEE Computer Society (1982)","DOI":"10.1109\/SFCS.1982.61"}],"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-319-48749-6_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T22:19:34Z","timestamp":1558477174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48749-6_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487489","9783319487496"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48749-6_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"31 October 2016","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":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/cocoa2016\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}