{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:39:06Z","timestamp":1767137946434,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319559100","type":"print"},{"value":"9783319559117","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-55911-7_11","type":"book-chapter","created":{"date-parts":[[2017,3,20]],"date-time":"2017-03-20T10:23:37Z","timestamp":1490005417000},"page":"144-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling Fully Parallel Jobs with Integer Parallel Units"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Chau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Afrati, F., Bampis, E., Chekuri, C., Karger, D., Kenyon, C., Khanna, S., Milis, I., Queyranne, M., Skutella, M., Stein, C., Sviridenko, M.: Approximation schemes for minimizing average weighted completion time with release dates. In: 40th Annual Symposium on Foundations of Computer Science, FOCS, pp. 32\u201344. IEEE Computer Society (1999)","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"11_CR2","volume-title":"Scheduling Algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P.: Scheduling Algorithms, 5th edn. Springer, Heidelberg (2007)","edition":"5"},{"issue":"7","key":"11_CR3","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J Bruno","year":"1974","unstructured":"Bruno, J., Coffman Jr., E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17(7), 382\u2013387 (1974)","journal-title":"Commun. ACM"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-44669-9_56","volume-title":"Fundamentals of Computation Theory","author":"AV Fishkin","year":"2001","unstructured":"Fishkin, A.V., Jansen, K., Porkolab, L.: On minimizing average weighted completion time: a PTAS for scheduling general multiprocessor tasks. In: Freivalds, R. (ed.) FCT 2001. LNCS, vol. 2138, pp. 495\u2013507. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44669-9_56"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","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":"N Garg","year":"2007","unstructured":"Garg, N., Kumar, A., Pandit, V.: Order scheduling models: hardness and algorithms. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 96\u2013107. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-77050-3_8"},{"issue":"4","key":"11_CR6","doi-asserted-by":"crossref","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T Kawaguchi","year":"1986","unstructured":"Kawaguchi, T., Kyan, S.: Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM J. Comput. 15(4), 1119\u20131129 (1986)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"11_CR7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s10951-005-2860-x","volume":"8","author":"JY-T Leung","year":"2005","unstructured":"Leung, J.Y.-T., Li, H., Pinedo, M.: Order scheduling in an environment with dedicated resources in parallel. J. Sched. 8(5), 355\u2013386 (2005)","journal-title":"J. Sched."},{"issue":"5","key":"11_CR8","doi-asserted-by":"crossref","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.: Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. 38(5), 390\u2013395 (2010)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"11_CR9","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10951-006-7042-y","volume":"9","author":"TA Roemer","year":"2006","unstructured":"Roemer, T.A.: A note on the complexity of the concurrent open shop problem. J. Sched. 9(4), 389\u2013396 (2006)","journal-title":"J. Sched."},{"issue":"1","key":"11_CR10","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S.: Algorithms for scheduling independent tasks. J. ACM 23(1), 116\u2013127 (1976)","journal-title":"J. ACM"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-63397-9_32","volume-title":"Algorithms \u2014 ESA \u201997","author":"AS Schulz","year":"1997","unstructured":"Schulz, A.S., Skutella, M.: Scheduling-LPs bear probabilities randomized approximations for min-sum criteria. In: Burkard, R., Woeginger, G. (eds.) ESA 1997. LNCS, vol. 1284, pp. 416\u2013429. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/3-540-63397-9_32"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Skutella, M., Woeginger, G.J.: A PTAS for minimizing the weighted sum of job completion times on parallel machines. In: Proceedings of the Thirty-First Annual ACM STOC, pp. 400\u2013407. ACM (1999)","DOI":"10.1145\/301250.301356"},{"issue":"1\u20132","key":"11_CR13","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Naval Res. Logistics Q. 3(1\u20132), 59\u201366 (1956)","journal-title":"Naval Res. Logistics Q."},{"issue":"3","key":"11_CR14","doi-asserted-by":"crossref","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.: Minimizing total weighted completion time at a pre-assembly stage composed of two feeding machines. Int. J. Prod. Econ. 54(3), 247\u2013255 (1998)","journal-title":"Int. J. Prod. Econ."},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.tcs.2013.02.017","volume":"507","author":"Q Zhang","year":"2013","unstructured":"Zhang, Q., Weiwei, W., Li, M.: Minimizing the total weighted completion time of fully parallel jobs with integer parallel units. Theor. Comput. Sci. 507, 34\u201340 (2013)","journal-title":"Theor. Comput. Sci."}],"updated-by":[{"DOI":"10.1007\/978-3-319-55911-7_50","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2017,11,23]],"date-time":"2017-11-23T00:00:00Z","timestamp":1511395200000}}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55911-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T04:00:07Z","timestamp":1511323207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55911-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319559100","9783319559117"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55911-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}