{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:24:10Z","timestamp":1743049450975,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_13","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"139-148","source":"Crossref","is-referenced-by-count":1,"title":["On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters"],"prefix":"10.1007","author":[{"given":"Deshi","family":"Ye","sequence":"first","affiliation":[]},{"given":"Lili","family":"Mei","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line load balancing with applications to machine scheduling and virtual circuit routing. Journal of the ACM\u00a044, 486\u2013504 (1997)","journal-title":"Journal of the ACM"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1137\/0212033","volume":"12","author":"B.S. Baker","year":"1983","unstructured":"Baker, B.S., Schwartz, J.S.: Shelf algorithms for two-dimensional packing problems. SIAM Journal on Computing\u00a012, 508\u2013525 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1006\/jagm.1999.1070","volume":"35","author":"P. Berman","year":"2000","unstructured":"Berman, P., Charikar, M., Karpinski, M.: On-line load balancing for related machines. Journal of Algorithms\u00a035, 108\u2013121 (2000)","journal-title":"Journal of Algorithms"},{"key":"13_CR4","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press (1998)"},{"key":"13_CR5","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.\u00a06271, pp. 157\u2013167. Springer, Heidelberg (2010)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., Trystram, D.: Approximating the non-contiguous multiple organization packing problem. In: Proceedings of Theoretical Computer Science: the 6th IFIP WG 2.2 International Conference (TCS), pp. 316\u2013327 (2010)","DOI":"10.1007\/978-3-642-15240-5_23"},{"key":"13_CR7","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 Algorithms for Multiple Strip Packing. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol.\u00a05893, pp. 37\u201348. Springer, Heidelberg (2010)"},{"key":"13_CR8","unstructured":"Bougeret, M., Dutot, P.F., Trystram, D.: An extention of the 5\/2-approximation algorithm using oracle. Research Report (2010)"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Kenyon, C.: Competitiveness via doubling. In: SIGACT News, pp. 115\u2013126 (2006)","DOI":"10.1145\/1189056.1189078"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E.G. Coffman","year":"1980","unstructured":"Coffman, E.G., Garey, M.R., Johnson, D.S., Tarjan, R.E.: Performance bounds for level oriented two-dimensional packing algorithms. SIAM Journal on Computing\u00a09, 808\u2013826 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Ebenlendr, T., Sgall, J.: A lower bound on deterministic online algorithms for scheduling on related machines without preemption. In: Proc. of the 9th Workshop on Approximation and Online Algorithms, WAOA 2011 (2012)","DOI":"10.1007\/978-3-642-29116-6_9"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-642-22300-6_40","volume-title":"Algorithms and Data Structures","author":"R. Harren","year":"2011","unstructured":"Harren, R., Jansen, K., Pr\u00e4del, L., van Stee, R.: A (5\/3 + \u03b5)-Approximation for Strip Packing. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol.\u00a06844, pp. 475\u2013487. Springer, Heidelberg (2011)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-540-77918-6_6","volume-title":"Approximation and Online Algorithms","author":"J.L. Hurink","year":"2008","unstructured":"Hurink, J.L., Paulus, J.J.: Online Algorithm for Parallel Job Scheduling and Strip Packing. In: Kaklamanis, C., Skutella, M. (eds.) WAOA 2007. LNCS, vol.\u00a04927, pp. 67\u201374. Springer, Heidelberg (2008)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Jansen, K., van Stee, R.: On strip packing With rotations. In: Proc. 37th Symp. Theory of Computing (STOC), pp. 755\u2013761 (2005)","DOI":"10.1145\/1060590.1060702"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Kenyon, C., Remila, E.: Approximate Strip Packing. In: Proc. 37th Symp. Foundations of Computer Science (FOCS), vol.\u00a037, pp. 31\u201337 (1996)","DOI":"10.1109\/SFCS.1996.548461"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BFb0049416","volume-title":"Algorithms - ESA \u201994","author":"I. Schiermeyer","year":"1994","unstructured":"Schiermeyer, I.: Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 290\u2013299. Springer, Heidelberg (1994)"},{"key":"13_CR17","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), pp. 1\u201310 (2008)","DOI":"10.1109\/IPDPS.2008.4536273"},{"key":"13_CR18","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\u2013409 (1997)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"13_CR19","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10878-007-9125-x","volume":"17","author":"D. Ye","year":"2009","unstructured":"Ye, D., Han, X., Zhang, G.: A note on online strip packing. Journal of Combinatorial Optimization\u00a017(4), 417\u2013423 (2009)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"13_CR20","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. Theoretical Computer Science\u00a0412(3), 233\u2013239 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"13_CR21","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"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:54:30Z","timestamp":1743026070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}