{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,31]],"date-time":"2022-10-31T18:50:07Z","timestamp":1667242207507},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10951-013-0341-1","type":"journal-article","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T11:19:56Z","timestamp":1374059996000},"page":"335-343","source":"Crossref","is-referenced-by-count":3,"title":["Scheduling semi-malleable jobs to minimize mean flow time"],"prefix":"10.1007","volume":"18","author":[{"given":"Yann","family":"Hendel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wieslaw","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,18]]},"reference":[{"issue":"2","key":"341_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s00453-001-0076-9","volume":"32","author":"A Amoura","year":"2002","unstructured":"Amoura, A., Bampis, E., Kenyon, C., & Manoussakis, I. (2002). Scheduling independent multiprocessor tasks. Algorithmica, 32(2), 247\u2013261.","journal-title":"Algorithmica"},{"key":"341_CR2","first-page":"8","volume":"22","author":"E Blayo","year":"2000","unstructured":"Blayo, E., Debreu, L., Mouni\u00e9, G., & Trystram, D. (2000). Dynamic load balancing for adaptive mesh ocean circulation model. Engineering Simulations, 22, 8\u201324.","journal-title":"Engineering Simulations"},{"key":"341_CR3","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1109\/TC.2006.58","volume":"55","author":"J Blazewicz","year":"2006","unstructured":"Blazewicz, J., Kovalyov, M. Y., Machowiak, M., Trystram, D., & Weglarz, J. (2006). Preemptable malleable task scheduling problem. IEEE Transactions on Computers, 55, 486\u2013490.","journal-title":"IEEE Transactions on Computers"},{"key":"341_CR4","unstructured":"Buisson, J., Sonmez, O., Mohamed, H., Lammers, W., & Epema, D. (2007). Scheduling malleable applications in multicluster systems. In IEEE International Conference on Cluster Computing (pp. 372\u2013381)."},{"key":"341_CR5","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/S0305-0548(99)00048-9","volume":"27","author":"M Drozdowski","year":"2000","unstructured":"Drozdowski, M., & Dell\u2019Olmo, P. (2000). Scheduling multiprocessor tasks for mean flow time criterion. Computers and OR, 27, 571\u2013585.","journal-title":"Computers and OR"},{"key":"341_CR6","doi-asserted-by":"crossref","unstructured":"Dutot, P. -F., Eyraud, L., Mouni\u00e9, G., & Trystram, D. (2004a). Bi-criteria algorithm for scheduling jobs on cluster platforms. In 16th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 125\u2013132).","DOI":"10.1145\/1007912.1007932"},{"key":"341_CR7","unstructured":"Dutot, P. -F., Mouni\u00e9, G., & Trystram, D. (2004b). Chapter 26, scheduling parallel tasks\u2014Approximation algorithms. In Handbook of scheduling. Boca Raton: CRC press."},{"key":"341_CR8","doi-asserted-by":"crossref","unstructured":"Feitelson, D., & Rudolph, L. (1990). Distributed hierarchical control for parallel processing. IEEE Transactions on Computers, 23, 65\u201377.","DOI":"10.1109\/2.53356"},{"key":"341_CR9","unstructured":"Hendel, Y., & Kubiak, W. (2008). Minimizing mean flow time for the two machines semimalleable jobs scheduling problem. In F. Serifoglu & \u00dc. Bilge (Eds.), Abstracts of the 11th Internat. Workshop on Project Management and Scheduling (pp. 136\u2013140)."},{"issue":"5","key":"341_CR10","first-page":"445","volume":"31","author":"CY Lee","year":"1999","unstructured":"Lee, C. Y., & Cai, X. (1999). Scheduling one and two processor tasks on two parallel processors. IIE Transactions, 31(5), 445\u2013455.","journal-title":"IIE Transactions"},{"key":"341_CR11","unstructured":"Ludwig, W. T. (1995). Algorithms for scheduling malleable and non-malleable parallel tasks. Ph.D. thesis, University of Wisconsin-Madison."},{"key":"341_CR12","unstructured":"Ludwig, W. T., & Tiwari, P. (1994). Scheduling malleable and non-malleable parallel tasks. In Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (pp. 167\u2013176)."},{"key":"341_CR13","doi-asserted-by":"crossref","first-page":"1265","DOI":"10.1016\/j.cor.2011.02.023","volume":"39","author":"R Sadykov","year":"2012","unstructured":"Sadykov, R. (2012). A dominant class of schedules for malleable jobs in the problem to minimize the total weighted completion time. Computers and OR, 39, 1265\u20131270.","journal-title":"Computers and OR"},{"key":"341_CR14","doi-asserted-by":"crossref","unstructured":"Turek, J., Wolf, J. L., & Yu, P. S. (1992). Approximate algorithms scheduling parallelizable tasks. In 14th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 323\u2013332).","DOI":"10.1145\/140901.141909"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0341-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0341-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0341-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:48Z","timestamp":1559468388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0341-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,18]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["341"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0341-1","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,18]]}}}