{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T07:40:11Z","timestamp":1743666011662,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642321467"},{"type":"electronic","value":"9783642321474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32147-4_37","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T11:54:50Z","timestamp":1341489290000},"page":"416-426","source":"Crossref","is-referenced-by-count":2,"title":["Completion Time Scheduling and the WSRPT Algorithm"],"prefix":"10.1007","author":[{"given":"Bo","family":"Xiong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","first-page":"287","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 theory: a survey. ADM\u00a05, 287\u2013326 (1979)","journal-title":"ADM"},{"key":"37_CR2","unstructured":"Labetoulle, J., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Preemptive scheduling of uniform machines subject to release dates (1982)"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Du, J., Leung, J.Y.T., Young, G.H.: Minimizing mean flow time with release time constraint. Theoretical Computer Science\u00a075 (1990)","DOI":"10.1016\/0304-3975(90)90100-V"},{"key":"37_CR4","unstructured":"Vestjens, A.: On-line machine scheduling. Ph.d. thesis, Eindhoven University of Technology (1997)"},{"key":"37_CR5","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.orl.2003.11.008","volume":"32","author":"N. Megow","year":"2004","unstructured":"Megow, N., Schulz, A.S.: On-line scheduling to minimize average completion time revisited. Operations Research Letters\u00a032, 485\u2013490 (2004)","journal-title":"Operations Research Letters"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/978-3-642-13036-6_31","volume-title":"Integer Programming and Combinatorial Optimization","author":"R. Sitters","year":"2010","unstructured":"Sitters, R.: Efficient Algorithms for Average Completion Time Scheduling. In: Eisenbrand, F., Shepherd, F.B. (eds.) IPCO 2010. LNCS, vol.\u00a06080, pp. 411\u2013423. Springer, Heidelberg (2010)"},{"key":"37_CR7","first-page":"199","volume":"82","author":"C.A. Phillips","year":"1998","unstructured":"Phillips, C.A., Stein, C., Wein, J.: Minimizing average completion time in the presence of release dates. Math. Program.\u00a082, 199\u2013223 (1998)","journal-title":"Math. Program."},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Bansal, N., Harchol-Balter, M.: Analysis of srpt scheduling: investigating unfairness. In: Proceedings of the 2001 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2001, pp. 279\u2013290 (2001)","DOI":"10.1145\/384268.378792"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/762483.762486","volume":"21","author":"M. Harchol-Balter","year":"2003","unstructured":"Harchol-Balter, M., Schroeder, B., Bansal, N., Agrawal, M.: Size-based scheduling to improve web performance. ACM Trans. Comput. Syst.\u00a021, 207\u2013233 (2003)","journal-title":"ACM Trans. Comput. Syst."},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Gong, M., Williamson, C.: Quantifying the properties of srpt scheduling. In: International Symposium on Modeling, Analysis, and Simulation of Computer Systems, p. 126 (2003)","DOI":"10.1109\/MASCOT.2003.1240650"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Chung, C., Nonner, T., Souza, A.: Srpt is 1.86-competitive for completion time scheduling. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 1373\u20131388 (2010)","DOI":"10.1137\/1.9781611973075.111"},{"key":"37_CR12","unstructured":"Megow, N.: Coping with incomplete information in scheduling - stochastic and online models, Technische Universitt Berlin (2006)"},{"key":"37_CR13","doi-asserted-by":"publisher","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. Naval Research Logistics Quarterly\u00a03, 59\u201366 (1956)","journal-title":"Naval Research Logistics Quarterly"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32147-4_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T07:20:35Z","timestamp":1743664835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}