{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:09:12Z","timestamp":1763467752865},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_17","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"181-190","source":"Crossref","is-referenced-by-count":14,"title":["Better Algorithms for Minimizing Average Flow-Time on Related Machines"],"prefix":"10.1007","author":[{"given":"Naveen","family":"Garg","sequence":"first","affiliation":[]},{"given":"Amit","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. In: SPAA, pp. 11\u201318 (2003)","DOI":"10.1145\/777412.777415"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, Azar, Leonardi, Regev.: Minimizing the flow time without migration. In: STOC: ACM Symposium on Theory of Computing (STOC) (1999)","DOI":"10.1145\/301250.301304"},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Chekuri, Khanna, Zhu.: Algorithms for minimizing weighted flow time. In: STOC: ACM Symposium on Theory of Computing (STOC) (2001)","DOI":"10.1145\/380752.380778"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Garg, Kumar.: Minimizing average flow time on related machines. In: STOC: ACM Symposium on Theory of Computing (STOC) (2006)","DOI":"10.1145\/1132516.1132618"},{"key":"17_CR5","unstructured":"Goel.: B. tech thesis. In: Computer Science and Engineering, IIT Delhi (2004)"},{"key":"17_CR6","unstructured":"Goemans, M.X.: Improved approximation algorthims for scheduling with release dates. In: SODA 1997: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 591\u2013598 (1997)"},{"key":"17_CR7","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 survey. Ann. Discrete Mathematics\u00a05, 287\u2013326 (1979)","journal-title":"Ann. Discrete Mathematics"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. In: STOC, pp. 110\u2013119 (1997)","DOI":"10.1145\/258533.258562"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:44Z","timestamp":1619507984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11786986_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}