{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:42:12Z","timestamp":1746438132639,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T00:00:00Z","timestamp":1523836800000},"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":["J Sched"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10951-018-0563-3","type":"journal-article","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T08:23:21Z","timestamp":1523867001000},"page":"619-631","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Scheduling fully parallel jobs"],"prefix":"10.1007","volume":"21","author":[{"given":"Kai","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3362-2063","authenticated-orcid":false,"given":"Vincent","family":"Chau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,16]]},"reference":[{"key":"563_CR1","unstructured":"Afrati, F. N., Bampis, E., Chekuri, C., Karger, D. R., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., & Sviridenko, M. (1999). Approximation schemes for minimizing average weighted completion time with release dates. In 40th IEEE computer society annual symposium on foundations of computer science, FOCS (pp. 32\u201344). \n                    http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=6604\n                    \n                  ."},{"key":"563_CR2","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2010","unstructured":"Brucker, P. (2010). Scheduling algorithms (5th ed.). Berlin: Springer.","edition":"5"},{"issue":"7","key":"563_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J Bruno","year":"1974","unstructured":"Bruno, J., Coffman, E. G, Jr., & Sethi, R. (1974). Scheduling independent tasks to reduce mean finishing time. Communications of the ACM, 17(7), 382\u2013387.","journal-title":"Communications of the ACM"},{"key":"563_CR4","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-44669-9_56","volume-title":"Fundamentals of Computation Theory","author":"Aleksei V. Fishkin","year":"2001","unstructured":"Fishkin, A. V., Jansen, K., & Porkolab, L. (2001). On minimizing average weighted completion time: A PTAS for scheduling general multiprocessor tasks. In 13th FCT 2001, Springer, LNCS, (vol. 2138, pp. 495\u2013507)."},{"key":"563_CR5","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-77050-3_8","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"Naveen Garg","year":"2007","unstructured":"Garg, N., Kumar, A., & Pandit, V. (2007). Order scheduling models: Hardness and algorithms. In FSTTCS 2007, Springer, LNCS, (vol. 4855, pp 96\u2013107)."},{"issue":"4","key":"563_CR6","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10951-013-0341-1","volume":"18","author":"Y Hendel","year":"2015","unstructured":"Hendel, Y., Kubiak, W., & Trystram, D. (2015). Scheduling semi-malleable jobs to minimize mean flow time. Journal of Scheduling, 18(4), 335\u2013343.","journal-title":"Journal of Scheduling"},{"key":"563_CR7","unstructured":"Kalaitzis, C., Svensson, O., & Tarnawski, J. (2017). Unrelated machine scheduling of jobs with uniform smith ratios. In Proceedings of the twenty-eighth annual ACM-SIAM symposium on discrete algorithms, society for industrial and applied mathematics, Philadelphia, PA, USA, SODA \u201917 (pp. 2654\u20132669) \n                    http:\/\/dl.acm.org\/citation.cfm?id=3039686.3039861\n                    \n                  ."},{"issue":"4","key":"563_CR8","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T Kawaguchi","year":"1986","unstructured":"Kawaguchi, T., & Kyan, S. (1986). Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15(4), 1119\u20131129.","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"563_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s10951-005-2860-x","volume":"8","author":"JY Leung","year":"2005","unstructured":"Leung, J. Y., Li, H., & Pinedo, M. (2005). Order scheduling in an environment with dedicated resources in parallel. Journal of Scheduling, 8(5), 355\u2013386.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"563_CR10","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/j.orl.2010.04.011","volume":"38","author":"M Mastrolilli","year":"2010","unstructured":"Mastrolilli, M., Queyranne, M., Schulz, A. S., Svensson, O., & Uhan, N. A. (2010). Minimizing the sum of weighted completion times in a concurrent open shop. Operations Research Letters, 38(5), 390\u2013395.","journal-title":"Operations Research Letters"},{"issue":"4","key":"563_CR11","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/s10951-006-7042-y","volume":"9","author":"TA Roemer","year":"2006","unstructured":"Roemer, T. A. (2006). A note on the complexity of the concurrent open shop problem. Journal Scheduling, 9(4), 389\u2013396.","journal-title":"Journal Scheduling"},{"issue":"1","key":"563_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the ACM (JACM), 23(1), 116\u2013127.","journal-title":"Journal of the ACM (JACM)"},{"key":"563_CR13","doi-asserted-by":"crossref","unstructured":"Schulz, A.S., & Skutella, M. (1997). Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria. In 5th Annual European symposium algorithms - ESA \u201997, Springer, LNCS (vol. 1284, pp 416\u2013429).","DOI":"10.1007\/3-540-63397-9_32"},{"key":"563_CR14","doi-asserted-by":"crossref","unstructured":"Skutella, M., & Woeginger, G.J. (1999). A PTAS for minimizing the weighted sum of job completion times on parallel machines. In Proceedings of the thirty-first annual ACM STOC, ACM (pp. 400\u2013407).","DOI":"10.1145\/301250.301356"},{"issue":"1\u20132","key":"563_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1\u20132), 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"563_CR16","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0925-5273(97)00151-5","volume":"54","author":"CS Sung","year":"1998","unstructured":"Sung, C. S., & Yoon, S. H. (1998). Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines. International Journal of Production Economics, 54(3), 247\u2013255.","journal-title":"International Journal of Production Economics"},{"key":"563_CR17","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2013.02.017","volume":"507","author":"Q Zhang","year":"2013","unstructured":"Zhang, Q., Wu, W., & Li, M. (2013). Minimizing the total weighted completion time of fully parallel jobs with integer parallel units. Theoretical Computer Science, 507, 34\u201340.","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0563-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0563-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0563-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T20:05:48Z","timestamp":1555358748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0563-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,16]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["563"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0563-3","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2018,4,16]]},"assertion":[{"value":"16 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}