{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:51:14Z","timestamp":1725742274543},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642400469"},{"type":"electronic","value":"9783642400476"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","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":[[2013]]},"DOI":"10.1007\/978-3-642-40047-6_11","type":"book-chapter","created":{"date-parts":[[2013,7,20]],"date-time":"2013-07-20T08:18:02Z","timestamp":1374308282000},"page":"78-89","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A (2\u2009+\u2009\u03b5)-Approximation for Scheduling Parallel Jobs in Platforms"],"prefix":"10.1007","author":[{"given":"Pierre-Fran\u00e7ois","family":"Dutot","sequence":"first","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":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s00453-001-0076-9","volume":"32","author":"A.K. Amoura","year":"2002","unstructured":"Amoura, A.K., Bampis, E., Kenyon, C., Manoussakis, Y.: Scheduling independent multiprocessor tasks. Algorithmica\u00a032(2), 247\u2013261 (2002)","journal-title":"Algorithmica"},{"key":"11_CR2","unstructured":"Bansal, N., Han, X., Iwama, K., Sviridenko, M., Zhang, G.: Harmonic algorithm for 3-dimensional strip packing problem. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2007), pp. 1197\u20131206 (2007)"},{"key":"11_CR3","series-title":"IFIP AICT","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.: Approximating the non-contiguous multiple organization packing problem. In: Calude, C.S., Sassone, V. (eds.) TCS 2010. IFIP AICT, vol.\u00a0323, pp. 316\u2013327. Springer, Heidelberg (2010)"},{"key":"11_CR4","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, Part I. LNCS, vol.\u00a06271, pp. 157\u2013167. Springer, Heidelberg (2010)"},{"issue":"4","key":"11_CR5","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1142\/S1793830911001413","volume":"3","author":"M. Bougeret","year":"2011","unstructured":"Bougeret, M., Dutot, P.-F., Jansen, K., Robenek, C., Trystram, D.: Approximation algorithms for multiple strip packing and scheduling parallel jobs in platforms. Discrete Mathematics, Algorithms and Applications\u00a03(4), 553\u2013586 (2011)","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Bougeret, M., Dutot, P.-F., Jansen, K., Robenek, C., Trystram, D.: Tight approximation for scheduling parallel jobs on identical clusters. In: IEEE International Parallel and Distributed Processing Symposium Workshops, pp. 878\u2013885 (2012)","DOI":"10.1109\/IPDPSW.2012.108"},{"issue":"4","key":"11_CR7","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 of Discrete Mathematics\u00a02(4), 473\u2013487 (1989)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Dutot, P.-F., Jansen, K., Robenek, C., Trystram, D.: A (2\u2009+\u2009\u03b5)-approximation for scheduling parallel jobs in platforms. Department of Computer Science, University Kiel, Technical Report No. 1217 (2013)","DOI":"10.1007\/978-3-642-40047-6_11"},{"issue":"2","key":"11_CR9","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":"11_CR10","doi-asserted-by":"crossref","unstructured":"Jansen, K.: A (3\/2\u2009+\u2009\u03b5) approximation algorithm for scheduling moldable and non-moldable parallel tasks. In: 24th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2012), pp. 224\u2013235 (2012)","DOI":"10.1145\/2312005.2312048"},{"issue":"3","key":"11_CR11","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":"11_CR12","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":"11_CR13","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(4), 645\u2013656 (2000)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"11_CR14","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1145\/3828.3833","volume":"32","author":"C.C. Lee","year":"1985","unstructured":"Lee, C.C., Lee, D.T.: A simple on-line bin-packing algorithm. Journal of the ACM\u00a032(3), 562\u2013572 (1985)","journal-title":"Journal of the ACM"},{"key":"11_CR15","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":"11_CR16","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1002\/cpe.1378","volume":"21","author":"F. Pascual","year":"2009","unstructured":"Pascual, F., Rzadca, K., Trystram, D.: Cooperation in multi-organization scheduling. Journal of Concurrency and Computation: Practice and Experience\u00a021, 905\u2013921 (2009)","journal-title":"Journal of Concurrency and Computation: Practice and Experience"},{"issue":"7","key":"11_CR17","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1016\/j.future.2012.02.004","volume":"28","author":"A. Quezada-Pina","year":"2012","unstructured":"Quezada-Pina, A., Tchernykh, A., Gonzlez-Garca, J., Hirales-Carbajal, A., Miranda-Lpez, V., Ramrez-Alcaraz, J., Schwiegelshohn, U., Yahyapour, R.: Adaptive job scheduling on hierarchical Grids. Future Generation Computer Systems\u00a028(7), 965\u2013976 (2012)","journal-title":"Future Generation Computer Systems"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Schwiegelshohn, U., Tchernykh, A., Yahyapour, R.: Online scheduling in grids. In: IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008), pp. 1\u201310 (2008)","DOI":"10.1109\/IPDPS.2008.4536273"},{"issue":"3","key":"11_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00453-003-1016-7","volume":"36","author":"S.S. Seiden","year":"2003","unstructured":"Seiden, S.S., van Stee, R.: New bounds for multidimensional packing. Algorithmica\u00a036(3), 261\u2013293 (2003)","journal-title":"Algorithmica"},{"key":"11_CR20","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)"},{"issue":"5","key":"11_CR21","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10951-010-0169-x","volume":"13","author":"A. Tchernykh","year":"2010","unstructured":"Tchernykh, A., Schwiegelsohn, U., Yahyapour, R., Kuzjurin, N.: On-line Hierarchical Job Scheduling on Grids with Admissible Allocation. Journal of Scheduling\u00a013(5), 545\u2013552 (2010)","journal-title":"Journal of Scheduling"},{"key":"11_CR22","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":"11_CR23","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","Euro-Par 2013 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40047-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T16:04:31Z","timestamp":1646150671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40047-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642400469","9783642400476"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40047-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}