{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:00:22Z","timestamp":1783576822705,"version":"3.55.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030293994","type":"print"},{"value":"9783030294007","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29400-7_8","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"103-116","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Linear Time Algorithms for Multiple Cluster Scheduling and Multiple Strip Packing"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Jansen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5710-560X","authenticated-orcid":false,"given":"Malin","family":"Rau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-642-15277-1_16","volume-title":"Euro-Par 2010 - Parallel Processing","author":"M Bougeret","year":"2010","unstructured":"Bougeret, M., Dutot, P.-F., Jansen, K., Otte, C., Trystram, D.: A fast 5\/2-approximation algorithm for hierarchical scheduling. In: D\u2019Ambra, P., Guarracino, M., Talia, D. (eds.) Euro-Par 2010. LNCS, vol. 6271, pp. 157\u2013167. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15277-1_16"},{"issue":"4","key":"8_CR2","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S1793830911001413","volume":"3","author":"M Bougeret","year":"2011","unstructured":"Bougeret, M., Dutot, P., Jansen, K., Robenek, C., Trystram, D.: Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms. Discrete Math. Alg. Appl. 3(4), 553\u2013586 (2011)","journal-title":"Discrete Math. Alg. Appl."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2015.07.003","volume":"600","author":"M Bougeret","year":"2015","unstructured":"Bougeret, M., Dutot, P., Trystram, D., Jansen, K., Robenek, C.: Improved approximation algorithms for scheduling parallel jobs on identical clusters. Theor. Comput. Sci. 600, 70\u201385 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Dutot, P., Jansen, K., Robenek, C., Trystram, D.: A (2 + $$\\epsilon $$)-approximation for scheduling parallel jobs in platforms. In: Proceedings of the 19th Euro-Par, Aachen, Germany, August 26\u201330, 2013, pp. 78\u201389 (2013)","DOI":"10.1007\/978-3-642-40047-6_11"},{"issue":"2","key":"8_CR5","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."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Jansen, K.: A $$(3\/2+ \\varepsilon )$$ approximation algorithm for scheduling moldable and non-moldable parallel tasks. In: Proceedings of the 24th ACM SPAA, Pittsburgh, PA, USA, June 25\u201327, pp. 224\u2013235 (2012)","DOI":"10.1145\/2312005.2312048"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Jansen, K., Rau, M.: Linear time algorithms for multiple cluster scheduling and multiple strip packing. CoRR, abs\/1902.03428 (2019)","DOI":"10.1007\/978-3-030-29400-7_8"},{"issue":"3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.disopt.2009.04.001","volume":"6","author":"K Jansen","year":"2009","unstructured":"Jansen, K., Solis-Oba, R.: Rectangle packing with one-dimensional resource augmentation. Discrete Optim. 6(3), 310\u2013323 (2009)","journal-title":"Discrete Optim."},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.endm.2016.10.003","volume":"55","author":"K Jansen","year":"2016","unstructured":"Jansen, K., Trystram, D.: Scheduling parallel jobs on heterogeneous platforms. Electron. Notes Discrete Math. 55, 9\u201312 (2016)","journal-title":"Electron. Notes Discrete Math."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Marty, M.R., Hill, M.D.: Virtual hierarchies to support server consolidation. In: Proceedings of the 34th ISCA, June 9\u201313, San Diego, California, USA, pp. 46\u201356 (2007)","DOI":"10.1145\/1273440.1250670"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: Proceedings of the 22nd IEEE IPDPS, Miami, Florida USA, April 14\u201318, 2008, pp. 1\u201310 (2008)","DOI":"10.1109\/IPDPS.2008.4536273"},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A Steinberg","year":"1997","unstructured":"Steinberg, A.: A strip-packing algorithm with absolute performance bound 2. SIAM J. Comput. 26(2), 401\u2013409 (1997)","journal-title":"SIAM J. Comput."},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"774","DOI":"10.1007\/11752578_93","volume-title":"Parallel Processing and Applied Mathematics","author":"A Tchernykh","year":"2006","unstructured":"Tchernykh, A., Ram\u00edrez, J.M., Avetisyan, A., Kuzjurin, N., Grushin, D., Zhuk, S.: Two level job-scheduling strategies for a computational grid. In: Wyrzykowski, R., Dongarra, J., Meyer, N., Wa\u015bniewski, J. (eds.) PPAM 2005. LNCS, vol. 3911, pp. 774\u2013781. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11752578_93"},{"issue":"5","key":"8_CR14","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10951-010-0169-x","volume":"13","author":"A Tchernykh","year":"2010","unstructured":"Tchernykh, A., Schwiegelshohn, U., Yahyapour, R., Kuzjurin, N.: On-line hierarchical job scheduling on grids with admissible allocation. J. Scheduling 13(5), 545\u2013552 (2010)","journal-title":"J. Scheduling"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Turek, J., Wolf, J.L., Yu, P.S.: Approximate algorithms scheduling parallelizable tasks. In: Proceedings of the 4th (SPAA), pp. 323\u2013332 (1992)","DOI":"10.1145\/140901.141909"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.tcs.2009.09.029","volume":"412","author":"D Ye","year":"2011","unstructured":"Ye, D., Han, X., Zhang, G.: Online multiple-strip packing. Theor. Comput. Sci. 412(3), 233\u2013239 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1515\/156939206776241264","volume":"16","author":"S Zhuk","year":"2006","unstructured":"Zhuk, S.: Approximate algorithms to pack rectangles into several strips. Discrete Math. Appl. DMA 16(1), 73\u201385 (2006)","journal-title":"Discrete Math. Appl. DMA"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2019: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29400-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T00:02:48Z","timestamp":1691884968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29400-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030293994","9783030294007"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29400-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","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":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar.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":"142","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":"36","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,94","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,27","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":"double blind review in two cases","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}