{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:06:55Z","timestamp":1742922415925,"version":"3.40.3"},"publisher-location":"Boston, MA","reference-count":13,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9780387307701"},{"type":"electronic","value":"9780387301624"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-0-387-30162-4_240","type":"book-chapter","created":{"date-parts":[[2008,6,26]],"date-time":"2008-06-26T18:35:29Z","timestamp":1214505329000},"page":"544-546","source":"Crossref","is-referenced-by-count":3,"title":["Minimum Weighted Completion Time"],"prefix":"10.1007","author":[{"given":"V.S. Anil","family":"Kumar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhav V.","family":"Marathe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivasan","family":"Parthasarathy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"240_CR1_240","doi-asserted-by":"crossref","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.: Approximation schemes for minimizing average weighted completion time with release dates. In: Proc. of Foundations of Computer Science, pp.\u00a032\u201344 (1999)","DOI":"10.1109\/SFFCS.1999.814574"},{"key":"240_CR2_240","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J.L. Bruno","year":"1974","unstructured":"Bruno, J.L., Coffman, E.G., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17, 382\u2013387 (1974)","journal-title":"Commun. ACM"},{"key":"240_CR3_240","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"C. Chekuri","year":"2004","unstructured":"Chekuri, C., Khanna, S.: Approximation algorithms for minimizing weighted completion time. In: J. Y-T. Leung (eds.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Boca Raton (2004)"},{"issue":"1","key":"240_CR4_240","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/S0097539797327180","volume":"31","author":"C. Chekuri","year":"2001","unstructured":"Chekuri, C., Motwani, R., Natarajan, B., Stein, C.: Approximation techniques for average completion time scheduling. SIAM J.\u00a0Comput. 31(1), 146\u2013166 (2001)","journal-title":"SIAM J. Comput."},{"key":"240_CR5_240","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1137\/S089548019936223X","volume":"15","author":"M. Goemans","year":"2002","unstructured":"Goemans, M., Queyranne, M., Schulz, A., Skutella, M., Wang, Y.: Single machine scheduling with release dates. SIAM J.\u00a0Discret. Math. 15, 165\u2013192 (2002)","journal-title":"SIAM J. Discret. Math."},{"key":"240_CR6_240","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/S0895480199326104","volume":"14","author":"L.A. Goldberg","year":"2001","unstructured":"Goldberg, L.A., Paterson, M., Srinivasan, A., Sweedyk, E.: Better approximation guarantees for job-shop scheduling. SIAM J.\u00a0Discret. Math. 14, 67\u201392 (2001)","journal-title":"SIAM J. Discret. Math."},{"key":"240_CR7_240","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling: a\u00a0survey. Ann. Discret. Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"3","key":"240_CR8_240","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.22.3.513","volume":"22","author":"L.A. Hall","year":"1997","unstructured":"Hall, L.A., Schulz, A.S., Shmoys, D.B., Wein, J.: Scheduling to minimize average completion time: off-line and on-line approximation algorithms. Math. Oper. Res. 22(3), 513\u2013544 (1997)","journal-title":"Math. Oper. Res."},{"key":"240_CR9_240","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/opre.21.3.846","volume":"21","author":"W. Horn","year":"1973","unstructured":"Horn, W.: Minimizing average flow time with parallel machines. Oper. Res. 21, 846\u2013847 (1973)","journal-title":"Oper. Res."},{"key":"240_CR10_240","doi-asserted-by":"crossref","unstructured":"Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: Scheduling on unrelated machines under tree-like precedence constraints. In: APPROX-RANDOM, pp.\u00a0146\u2013157 (2005)","DOI":"10.1007\/11538462_13"},{"issue":"2","key":"240_CR11_240","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/375827.375840","volume":"46","author":"M. Skutella","year":"2001","unstructured":"Skutella, M.: Convex quadratic and semidefinite relaxations in scheduling. J.\u00a0ACM 46(2), 206\u2013242 (2001)","journal-title":"J. ACM"},{"key":"240_CR12_240","doi-asserted-by":"crossref","unstructured":"Skutella, M., Woeginger, G.J.: A\u00a0PTAS for minimizing the weighted sum of job completion times on parallel machines. In: Proc. of 31st Annual ACM Symposium on Theory of Computing (STOC '99), pp.\u00a0400\u2013407 (1999)","DOI":"10.1145\/301250.301356"},{"key":"240_CR13_240","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Log. Q. 3, pp.\u00a059\u201366 (1956)","journal-title":"Nav. Res. Log. Q."}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30162-4_240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T21:32:25Z","timestamp":1738272745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30162-4_240"}},"subtitle":["1999; Afrati et al."],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9780387307701","9780387301624"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30162-4_240","relation":{},"subject":[],"published":{"date-parts":[[2008]]}}}