{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:54Z","timestamp":1725600474181},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22685-4_25","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T04:54:39Z","timestamp":1312952079000},"page":"271-283","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Jobs on Heterogeneous Platforms"],"prefix":"10.1007","author":[{"given":"Marin","family":"Bougeret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre Francois","family":"Dutot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christina","family":"Robenek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","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":"25_CR2","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-15240-5_23","volume-title":"Theoretical Computer Science","author":"M. Bougeret","year":"2010","unstructured":"Bougeret, M., Dutot, P.F., Jansen, K., Otte, C., Trystram, D.: A low cost 5\/2 approximation for scheduling rigid jobs on multiple organizations. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP Advances in Information and Communication Technology, vol.\u00a0323, pp. 316\u2013327. Springer, Heidelberg (2010)"},{"key":"25_CR3","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)"},{"issue":"4","key":"25_CR4","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"Du, J., Leung, J.Y.-T.: Complexity of scheduling parallel task systems. SIAM Journal on Discrete Mathematics\u00a02(4), 473\u2013487 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Hall, L.A., Shmoys, D.B.: Approximation Schemes for Constrained Scheduling Problems. In: 30th Annual Symposium on Foundations of Computer Science (FOCS 1989), pp. 134\u2013139 (1989)","DOI":"10.1109\/SFCS.1989.63468"},{"key":"25_CR6","unstructured":"Harren, R., Jansen, K., Pr\u00e4del, L., van Stee, R.: A 5\/3 + \u03b5 approximation for strip packing. In: The 12th Symposium on Algorithms and Data Structures, WADS 2011 (to appear, 2011)"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s00453-003-1078-6","volume":"39","author":"K. Jansen","year":"2004","unstructured":"Jansen, K.: Scheduling malleable parallel tasks: An asymptotic fully polynomial time approximation scheme. Algorithmica\u00a039(1), 59\u201381 (2004)","journal-title":"Algorithmica"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11671541_6","volume-title":"Efficient Approximation and Online Algorithms","author":"K. Jansen","year":"2006","unstructured":"Jansen, K.: Approximation algorithms for min-max and max-min resource sharing problems and applications. In: Bampis, E., Jansen, K., Kenyon, C. (eds.) Efficient Approximation and Online Algorithms. LNCS, vol.\u00a03484, pp. 156\u2013202. Springer, Heidelberg (2006)"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00453-001-0085-8","volume":"32","author":"K. Jansen","year":"2002","unstructured":"Jansen, K., Porkolab, L.: Linear-time approximation schemes for scheduling malleable parallel tasks. Algorithmica\u00a032(3), 507\u2013520 (2002)","journal-title":"Algorithmica"},{"issue":"3","key":"25_CR10","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 Optimization\u00a06(3), 310\u2013323 (2009)","journal-title":"Discrete Optimization"},{"issue":"8","key":"25_CR11","doi-asserted-by":"publisher","first-page":"3571","DOI":"10.1137\/080736491","volume":"39","author":"K. Jansen","year":"2010","unstructured":"Jansen, K., Th\u00f6le, R.: Approximation algorithms for scheduling parallel jobs. SIAM Journal on Computing\u00a039(8), 3571\u20133615 (2010)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"E.G. Coffman Jr.","year":"1980","unstructured":"Coffman Jr., 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(4), 808\u2013826 (1980)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0204015","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"Garey, M.R., Graham, R.L.: Bounds for Multiprocessor Scheduling with Resource Constraints. SIAM Journal on Computing\u00a04(2), 187\u2013200 (1975)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1287\/moor.25.4.645.12118","volume":"25","author":"C. Kenyon","year":"2000","unstructured":"Kenyon, C., R\u00e9mila, E.: A near optimal solution to a two-dimensional cutting stock problem. Mathematics of Operations Research\u00a025, 645\u2013656 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"25_CR15","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1137\/S1052623499358689","volume":"11","author":"L.G. Khachiyan","year":"2001","unstructured":"Khachiyan, L.G., Grigoriadis, M.D., Porkolab, L., Villavicencio, J.: Approximate max-min resource sharing for structured concave optimization. SIAM Journal on Optimization\u00a011, 1081\u20131091 (2001)","journal-title":"SIAM Journal on Optimization"},{"issue":"4","key":"25_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E.L. Lawler","year":"1979","unstructured":"Lawler, E.L.: Fast approximation algorithms for knapsack problems. Mathematics of Operation Research\u00a04(4), 339\u2013356 (1979)","journal-title":"Mathematics of Operation Research"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"J.K. Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming\u00a046, 259\u2013271 (1990)","journal-title":"Mathematical Programming"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Mouni\u00e9, G., Rapine, C., Trystram, D.: Efficient approximation algorithms for scheduling malleable tasks. In: ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 23\u201332 (1999)","DOI":"10.1145\/305619.305622"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S.A. Plotkin","year":"1995","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, \u00c9.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research\u00a020, 257\u2013301 (1995)","journal-title":"Mathematics of Operations Research"},{"key":"25_CR20","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":"25_CR21","doi-asserted-by":"crossref","unstructured":"Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 1\u201310 (2008)","DOI":"10.1109\/IPDPS.2008.4536273"},{"issue":"2","key":"25_CR22","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(2), 401\u2013409 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR23","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., 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.\u00a03911, pp. 774\u2013781. Springer, Heidelberg (2006)"},{"key":"25_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-02026-1_14","volume-title":"Combinatorial Optimization and Applications","author":"D. Ye","year":"2009","unstructured":"Ye, D., Han, X., Zhang, G.: On-line multiple-strip packing. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol.\u00a05573, pp. 155\u2013165. Springer, Heidelberg (2009)"},{"issue":"1","key":"25_CR25","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1515\/156939206776241264","volume":"16","author":"S.N. Zhuk","year":"2006","unstructured":"Zhuk, S.N.: 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","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T19:39:24Z","timestamp":1560454764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}