{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:19:19Z","timestamp":1768515559753,"version":"3.49.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T00:00:00Z","timestamp":1517529600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T00:00:00Z","timestamp":1517529600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671355"],"award-info":[{"award-number":["11671355"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1217906"],"award-info":[{"award-number":["CCF-1217906"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1617735"],"award-info":[{"award-number":["CCF-1617735"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271325"],"award-info":[{"award-number":["11271325"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10951-018-0556-2","type":"journal-article","created":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T07:48:00Z","timestamp":1517557680000},"page":"647-654","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Online scheduling of moldable parallel tasks"],"prefix":"10.1007","volume":"21","author":[{"given":"Deshi","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny Z.","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,2]]},"reference":[{"issue":"3","key":"556_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. (1997). On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM, 44(3), 486\u2013504.","journal-title":"Journal of the ACM"},{"key":"556_CR2","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1137\/0212033","volume":"12","author":"B Baker","year":"1983","unstructured":"Baker, B., & Schwartz, J. (1983). Shelf algorithms for two-dimensional packing problems. SIAM Journal on Computing, 12, 508\u2013525.","journal-title":"SIAM Journal on Computing"},{"key":"556_CR3","unstructured":"Belkhale, K., & Banerjee, P. (1990). Approximate algorithms for the partitionable independent task scheduling problem. In Proceedings of the international conference on parallel processing (ICPP) (pp. 72\u201375)."},{"key":"556_CR4","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press."},{"key":"556_CR5","doi-asserted-by":"crossref","unstructured":"Cirne, W., & Berman, F. (2001). A model for moldable supercomputer jobs. In Proceedings of the 15th international parallel and distributed processing symposium (IPDPS) (pp. 59\u201366).","DOI":"10.1109\/IPDPS.2001.925004"},{"issue":"2","key":"556_CR6","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2006.05.012","volume":"361","author":"T Decker","year":"2006","unstructured":"Decker, T., L\u00fccking, T., & Monien, B. (2006). A 5\/4-approximation algorithm for scheduling identical malleable tasks. Theoretical Computer Science, 361(2), 226\u2013240.","journal-title":"Theoretical Computer Science"},{"key":"556_CR7","volume-title":"Handbook of scheduling: Algorithms, models and performance analysis","author":"P Dutot","year":"2004","unstructured":"Dutot, P., Mouni\u00e9, G., & Trystram, D. (2004). Scheduling parallel tasks approximation algorithms, Chapter 26. In J. Y.-T. Leung (Ed.), Handbook of scheduling: Algorithms, models and performance analysis. Boca Raton: CRC Press."},{"key":"556_CR8","unstructured":"Dutton, R., & Mao, W. (2007). Online scheduling of malleable parallel jobs. In Proceedings of the IASTED international conference on parallel and distributed computing and systems (pp. 1\u20136)."},{"issue":"3","key":"556_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1016\/j.ejor.2010.03.005","volume":"206","author":"S Guo","year":"2010","unstructured":"Guo, S., & Kang, L. (2010). Online scheduling of malleable parallel jobs with setup times on two identical machines. European Journal of Operational Research, 206(3), 555\u2013561.","journal-title":"European Journal of Operational Research"},{"key":"556_CR10","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1016\/j.ejor.2006.06.064","volume":"187","author":"J Havill","year":"2008","unstructured":"Havill, J., & Mao, W. (2008). Competitive online scheduling of perfectly malleable jobs with setup times. European Journal of Operational Research, 187, 1126\u20131142.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"556_CR11","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/7531.7535","volume":"34","author":"D Hochbaum","year":"1987","unstructured":"Hochbaum, D., & Shmoys, D. (1987). Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM, 34(1), 144\u2013162.","journal-title":"Journal of the ACM"},{"key":"556_CR12","unstructured":"Hurink, J., & Paulus, J. (2007). Online algorithm for parallel job scheduling and strip packing. In Proceedings of the 5th international workshop in approximation and online algorithms (WAOA) (pp. 67\u201374)."},{"key":"556_CR13","doi-asserted-by":"crossref","unstructured":"Jansen, K. (2012). A (3\/2 + $$\\varepsilon $$) approximation algorithm for scheduling moldable and non-moldable parallel tasks. In Proceedings of the 24th ACM symposium on parallelism in algorithms and architectures (SPAA) (pp. 224\u2013235).","DOI":"10.1145\/2312005.2312048"},{"issue":"3","key":"556_CR14","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. (2002). Linear-time approximation schemes for scheduling malleable parallel tasks. Algorithmica, 32(3), 507\u2013520.","journal-title":"Algorithmica"},{"issue":"8","key":"556_CR15","doi-asserted-by":"publisher","first-page":"3571","DOI":"10.1137\/080736491","volume":"39","author":"K Jansen","year":"2010","unstructured":"Jansen, K., & Th\u00f6le, R. (2010). Approximation algorithms for scheduling parallel jobs. SIAM Journal on Computing, 39(8), 3571\u20133615.","journal-title":"SIAM Journal on Computing"},{"key":"556_CR16","unstructured":"Kal\u00e9, L. (2002). The virtualization model of parallel programming: Runtime optimizations and the state of art. In Proceedings of Los Alamos computer science institute symposium (LACSI) (pp. 347\u2013364)."},{"issue":"4","key":"556_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s10951-014-0406-9","volume":"18","author":"N Kell","year":"2015","unstructured":"Kell, N., & Havill, J. (2015). Improved upper bounds for online malleable job scheduling. Journal of Scheduling, 18(4), 393\u2013410.","journal-title":"Journal of Scheduling"},{"key":"556_CR18","unstructured":"Ludwig, W., & Tiwari, P. (1994). Scheduling malleable and nonmalleable parallel tasks. In Proceedings of the 15th annual ACM-SIAM symposium on discrete algorithms (SODA) (pp. 167\u2013176)."},{"key":"556_CR19","doi-asserted-by":"crossref","unstructured":"Mouni\u00e9, G., Rapine, C., & Trystram, D. (1999). Efficient approximation algorithms for scheduling malleable tasks. In Proceedings of the 11th annual ACM symposium on parallel algorithms and architectures (SPAA) (pp. 23\u201332).","DOI":"10.1145\/305619.305622"},{"key":"556_CR20","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0097539701385995","volume":"37","author":"G Mouni\u00e9","year":"2007","unstructured":"Mouni\u00e9, G., Rapine, C., & Trystram, D. (2007). A $$\\frac{3}{2}$$-approximation algorithm for scheduling independent monotonic malleable tasks. SIAM Journal on Computing, 37, 401\u2013412.","journal-title":"SIAM Journal on Computing"},{"key":"556_CR21","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BFb0057869","volume-title":"Euro-Par\u201998 Parallel Processing","author":"Christophe Rapine","year":"1998","unstructured":"Rapine, C., Scherson, I., & Trystram, D. (1998). On-line scheduling of parallelizable jobs. In Proceedings of the 4th international euro-par conference on parallel processing (Euro-Par) (pp. 322\u2013327)."},{"key":"556_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-16505-4_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"Erik Saule","year":"2010","unstructured":"Saule, E., Bozda\u011f, D., & Catalyurek, U. (2010). A moldable online scheduling algorithm and its application to parallel short sequence mapping. In Proceedings of the 15th international conference on job scheduling strategies for parallel processing (JSSPP) (pp. 93\u2013109)."},{"key":"556_CR23","doi-asserted-by":"crossref","unstructured":"Turek, J., Wolf, J., & Yu, P. S. (1992). Approximate algorithms scheduling parallelizable tasks. In Proceedings of the 4th annual ACM symposium on parallel algorithms and architectures (SPAA) (pp. 323\u2013332).","DOI":"10.1145\/140901.141909"},{"issue":"4","key":"556_CR24","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. (2009). A note on online strip packing. Journal of Combinatorial Optimization, 17(4), 417\u2013423.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"3","key":"556_CR25","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.ejor.2015.10.012","volume":"250","author":"G Yu","year":"2016","unstructured":"Yu, G., Mao, Y., & Xiao, J. (2016). A new lower bound for online strip packing. European Journal of Operational Research, 250(3), 754\u2013759.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0556-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0556-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0556-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,30]],"date-time":"2024-06-30T22:37:50Z","timestamp":1719787070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0556-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,2]]},"references-count":25,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["556"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0556-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,2]]},"assertion":[{"value":"2 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}