{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T12:37:14Z","timestamp":1752669434778},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424956"},{"type":"electronic","value":"9783540446811"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"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":[[2001]]},"DOI":"10.1007\/3-540-44681-8_29","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T23:35:09Z","timestamp":1188344109000},"page":"191-197","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Approximation Algorithms for Scheduling Independent Malleable Tasks"],"prefix":"10.1007","author":[{"given":"J.","family":"Blazewicz","sequence":"first","affiliation":[]},{"given":"M.","family":"Machowiak","sequence":"additional","affiliation":[]},{"given":"G.","family":"Mouni\u00e9","sequence":"additional","affiliation":[]},{"given":"D.","family":"Trystram","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/TC.1986.1676781","volume":"35","author":"J. B.la\u017cewicz","year":"1986","unstructured":"J. B.la\u017cewicz, M. Drabowski, J. Weglarz: Scheduling multiprocessor tasks to minimize schedule length, IEEE Transactions on Computers 35, 1986, 389\u2013393.","journal-title":"IEEE Transactions on Computers"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1137\/0402042","volume":"2","author":"J. Du","year":"1989","unstructured":"J. Du, J. Y.-T. Leung: Complexity of scheduling parallel tasks systems. SIAM Journal on Discrete Mathematics 2, 1989, 473\u2013487.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R. L. Graham","year":"1966","unstructured":"R. L. Graham: Bounds for certain multiprocessing anomalies, Bell System Tech. J., 45, 1966, 1563\u20131581.","journal-title":"Bell System Tech. J."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"K. Jansen, L. Porkolab: Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks, In Tenth Annual ACM-SIAM Symposium on Discrete Algorithms (soda99), ACM-SIAM, 1999, 490\u2013498.","DOI":"10.1145\/301250.301361"},{"key":"29_CR5","unstructured":"W. T. Ludwig: Algorithms for scheduling malleable and non-malleable parallel tasks, PhD thesis, University of Wisconsin-Madison, Department of Computer Sciences, 1995."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"G. Mouni\u00e9, C. Rapine, D. Trystram: Efficient approximation algorithms for scheduling malleable tasks, In Eleventh ACM Symposium on Parallel Algorithms and Architectures (SPAA\u2019 99), ACM, 1999, 23\u201332.","DOI":"10.1145\/305619.305622"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"G. N. S. Prasanna, B. R. Musicus: The optimal control approach to generalized multiprocessor scheduling, Algorithmica, 1995.","DOI":"10.1007\/s004539900002"},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1137\/S0097539793255801","volume":"26","author":"A. Steinberg","year":"1997","unstructured":"A. Steinberg: A Strip-Packing Algorithm with Absolute Performance Bound 2, SI AM Journal on Computing 26(2), 1997, 401\u2013409.","journal-title":"SI AM Journal on Computing"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"J. Turek, J. Wolf, P. Yu: Approximate algorithms for scheduling parallelizable tasks, In 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992, 323\u2013332.","DOI":"10.1145\/140901.141909"},{"key":"29_CR10","volume-title":"Optimization and Control of Dynamic Operational Research Models","author":"J. Weglarz","year":"1982","unstructured":"J. Weglarz: Modelling and control of dynamic resource allocation project scheduling systems, In S. G. Tzafestas (ed.), Optimization and Control of Dynamic Operational Research Models, North-Holland, Amsterdam, 1982."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2001 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44681-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T19:11:53Z","timestamp":1684005113000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44681-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424956","9783540446811"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44681-8_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}