{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:27:44Z","timestamp":1742923664397,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152764"},{"type":"electronic","value":"9783642152771"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","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":[[2010]]},"DOI":"10.1007\/978-3-642-15277-1_16","type":"book-chapter","created":{"date-parts":[[2010,8,30]],"date-time":"2010-08-30T13:27:55Z","timestamp":1283174875000},"page":"157-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["A Fast 5\/2-Approximation Algorithm for Hierarchical Scheduling"],"prefix":"10.1007","author":[{"given":"Marin","family":"Bougeret","sequence":"first","affiliation":[]},{"given":"Pierre-Fran\u00e7ois","family":"Dutot","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[]},{"given":"Christina","family":"Otte","sequence":"additional","affiliation":[]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1177\/109434200101500302","volume":"15","author":"I. Foster","year":"2001","unstructured":"Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the grid: Enabling scalable virtual organizations. International Journal of High Performance Computing Applications\u00a015(3), 200 (2001)","journal-title":"International Journal of High Performance Computing Applications"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Feitelson, D.G., Rudolph, L., Schwiegelshohn, U., Sevcik, K.C., Wong, P.: Theory and practice in parallel job scheduling. In: JSSPP, pp. 1\u201334 (1997)","DOI":"10.1007\/3-540-63574-2_14"},{"issue":"1","key":"16_CR3","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 Mathematics and Applications\u00a016(1), 73\u201385 (2006)","journal-title":"Discrete Mathematics and Applications"},{"key":"16_CR4","first-page":"165","volume-title":"Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications (COCOA)","author":"D. Ye","year":"2009","unstructured":"Ye, D., Han, X., Zhang, G.: On-Line Multiple-Strip Packing. In: Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications (COCOA), p. 165. Springer, Heidelberg (2009)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-12450-1_4","volume-title":"Approximation and Online Algorithms","author":"M. Bougeret","year":"2010","unstructured":"Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., Trystram, D.: Approximation algorithm for multiple strip packing. In: Bampis, E., Jansen, K. (eds.) WAOA 2010. LNCS, vol.\u00a05893, pp. 37\u201348. Springer, Heidelberg (2010)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-74466-5_25","volume-title":"Euro-Par 2007 Parallel Processing","author":"F. Pascual","year":"2007","unstructured":"Pascual, F., Rzadca, K., Trystram, D.: Cooperation in multi-organization scheduling. In: Kermarrec, A.-M., Boug\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol.\u00a04641, pp. 224\u2013233. Springer, Heidelberg (2007)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2008, pp. 1\u201310 (2008)","DOI":"10.1109\/IPDPS.2008.4536273"},{"key":"16_CR8","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 Journal on Computing\u00a026, 401 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D. Hochbaum","year":"1988","unstructured":"Hochbaum, D., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput.\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2010 - Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15277-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,19]],"date-time":"2020-05-19T14:13:02Z","timestamp":1589897582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15277-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152764","9783642152771"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15277-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}