{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T11:46:18Z","timestamp":1772106378180,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540645900","type":"print"},{"value":"9783540693468","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-69346-7_29","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T15:51:29Z","timestamp":1186069889000},"page":"383-393","source":"Crossref","is-referenced-by-count":14,"title":["An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines"],"prefix":"10.1007","author":[{"given":"Chandra","family":"Chekuri","sequence":"first","affiliation":[]},{"given":"Michael","family":"Bender","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1998,6,18]]},"reference":[{"key":"29_CR1","unstructured":"F. Chudak and D. Shmoys. Approximation algorithms for precedence-constrained scheduling problems on parallel machines that run at different speeds. Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1997."},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and S. Winograd. Matrix multiplication via arithmetic progression. Proceedings of the 19th ACM Symposium on Theory of Computing, pages 1\u20136, 1987.","DOI":"10.1145\/28395.28396"},{"key":"29_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979."},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"R.L. Graham","year":"1966","unstructured":"R.L. Graham. Bounds for certain multiprocessor anomalies. Bell System Tech. J., 45:1563\u201381, 1966.","journal-title":"Bell System Tech. J."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann. Discrete Math., 5:287\u2013326, 1979.","journal-title":"Ann. Discrete Math."},{"issue":"1","key":"29_CR6","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/321992.321995","volume":"24","author":"E. Horvath","year":"1977","unstructured":"E. Horvath, S. Lam, and R. Sethi. A level algorithm for preemptive scheduling. Journal of the ACM, 24(1):32\u201343, 1977.","journal-title":"Journal of the ACM"},{"key":"29_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(80)90002-X","volume":"26","author":"J. Jaffe","year":"1980","unstructured":"J. Jaffe. Efficient scheduling of tasks without full use of processor resources. Theoretical Computer Science, 26:1\u201317, 1980.","journal-title":"Theoretical Computer Science"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.26.1.22","volume":"26","author":"J. K. Lenstra","year":"1978","unstructured":"J. K. Lenstra and A. H. G. Rinnooy Kan. Complexity of scheduling under precedence constraints. Operations Research, 26:22\u201335, 1978.","journal-title":"Operations Research"},{"key":"29_CR9","unstructured":"J. W. S. Lui and C. L. Lui. Bounds on scheduling algorithms for heterogeneous computing systems. In J. L. Rosenfeld, editor, Information Processing 74, pages 349\u2013353. North-Holland, 1974."},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"D. Shmoys","year":"1995","unstructured":"D. Shmoys, J. Wein, and D. Williamson. Scheduling parallel machines on-line. SIAM Journal on Computing, 24:1313\u201331, 1995.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-69346-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T21:53:02Z","timestamp":1550440382000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-69346-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540645900","9783540693468"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-69346-7_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}