{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T12:32:30Z","timestamp":1742387550964},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540287001"},{"type":"electronic","value":"9783540319252"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11549468_35","type":"book-chapter","created":{"date-parts":[[2010,10,25]],"date-time":"2010-10-25T17:18:34Z","timestamp":1288027114000},"page":"302-311","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Hierarchical Scheduling for Moldable Tasks"],"prefix":"10.1007","author":[{"given":"Pierre-Fran\u00e7ois","family":"Dutot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/378580.378640","volume-title":"Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures","author":"P.F. Dutot","year":"2001","unstructured":"Dutot, P.F., Trystram, D.: Scheduling on hierarchical clusters using malleable tasks. In: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pp. 199\u2013208. ACM Press, New York (2001)"},{"key":"35_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"Du, J., Leung, J.T.: Complexity of scheduling parallel tasks systems. SIAM Journal on Discrete Mathematics\u00a02, 473\u2013487 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44676-1_12","volume-title":"Algorithms - ESA 2001","author":"R. Lepere","year":"2001","unstructured":"Lepere, R., Trystram, D., Woeginger, G.: Approximation algorithms for scheduling malleable tasks under precedence constraints. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 146\u2013157. Springer, Heidelberg (2001)"},{"key":"35_CR4","unstructured":"Zhang, H.: Approximation Algorithms for Min-Max Resource Sharing and Malleable Tasks Scheduling. PhD thesis, University of Kiel, Germany (2004)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Jansen, K., Zhang, H.: Scheduling malleable tasks with precedence constraints. In: 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2005), Las Vegas (2005)","DOI":"10.1145\/1073970.1073983"},{"key":"35_CR6","doi-asserted-by":"crossref","unstructured":"Jansen, K., Zhang, H.: An approximation algorithm for scheduling malleable tasks under general precedence constraints (2005) (submitted)","DOI":"10.1007\/11602613_25"},{"key":"35_CR7","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1287\/moor.23.4.909","volume":"23","author":"M. Skutella","year":"1998","unstructured":"Skutella, M.: Approximation algorithms for the discrete time-cost tradeoff problem. Mathematics of Operations Research\u00a023, 909\u2013929 (1998)","journal-title":"Mathematics of Operations Research"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Dutot, P.F.: Hierarchical scheduling for moldable tasks \u2013 extended version. Technical report, Laboratory ID-IMAG (2005), \n                    \n                      http:\/\/www-id.imag.fr\/~pfdutot\/perso.html","DOI":"10.1007\/11605300_8"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2005 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11549468_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:18:02Z","timestamp":1587341882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11549468_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287001","9783540319252"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11549468_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}