{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,7]],"date-time":"2024-04-07T13:14:40Z","timestamp":1712495680687},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1016\/j.orl.2004.07.008","type":"journal-article","created":{"date-parts":[[2004,10,12]],"date-time":"2004-10-12T17:34:08Z","timestamp":1097602448000},"page":"267-273","source":"Crossref","is-referenced-by-count":9,"title":["Minimizing flow time on a constant number of machines with preemption"],"prefix":"10.1016","volume":"33","author":[{"given":"Nikhil","family":"Bansal","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.07.008_bib1","series-title":"IEEE Symposium on Foundations of Computer Science","first-page":"32","article-title":"Approximation schemes for minimizing average weighted completion time with release dates","author":"Afrati","year":"1999"},{"key":"10.1016\/j.orl.2004.07.008_bib2","series-title":"ACM Symposium on Theory of Computing","first-page":"198","article-title":"Minimizing the flow time without migration","author":"Awerbuch","year":"1999"},{"key":"10.1016\/j.orl.2004.07.008_bib3","series-title":"ACM\u2013SIAM Symposium on Discrete Algorithms (SODA)","first-page":"270","article-title":"Flow and stretch metrics for scheduling continuous job streams","author":"Bender","year":"1998"},{"key":"10.1016\/j.orl.2004.07.008_bib4","series-title":"ACM Symposium on Theory of Computing (STOC)","article-title":"Approximation schemes for preemptive weighted flow time","author":"Chekuri","year":"2002"},{"key":"10.1016\/j.orl.2004.07.008_bib5","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(90)90100-V","article-title":"Minimizing mean flow time with release time constraint","volume":"75","author":"Du","year":"1990","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.orl.2004.07.008_bib6","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/j.orl.2004.07.008_bib7","doi-asserted-by":"crossref","unstructured":"J.A. Hoogeveen, P. Schuurman, G.J. Woeginger, Non-approximability results for scheduling problems with minsum criteria, in: Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, vol. 1412, Springer, Berlin, 1998, pp. 353\u2013366.","DOI":"10.1007\/3-540-69346-7_27"},{"key":"10.1016\/j.orl.2004.07.008_bib8","series-title":"ACM Symposium on Theory of Computing","first-page":"408","article-title":"Improved approximation schemes for scheduling unrelated parallel machines","author":"Jansen","year":"1999"},{"key":"10.1016\/j.orl.2004.07.008_bib9","series-title":"ACM Symposium on Theory of Computing (STOC)","first-page":"418","article-title":"Approximability and nonapproximability results for minimizing total flow time on a single machine","author":"Kellerer","year":"1996"},{"key":"10.1016\/j.orl.2004.07.008_bib10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","article-title":"Approximation algorithms for scheduling unrelated parallel machines","volume":"46","author":"Lenstra","year":"1990","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2004.07.008_bib11","series-title":"ACM Symposium on Theory of Computing (STOC)","first-page":"110","article-title":"Approximating total flow time on parallel machines","author":"Leonardi","year":"1997"},{"key":"10.1016\/j.orl.2004.07.008_bib12","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1287\/opre.16.3.687","article-title":"A proof of the optimality of the shortest processing remaining time discipline","volume":"16","author":"Schrage","year":"1968","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2004.07.008_bib13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","article-title":"Polynomial time approximation algorithms for machine scheduling","volume":"2","author":"Schuurman","year":"1999","journal-title":"J. Sched."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704001038?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704001038?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,3]],"date-time":"2019-02-03T05:26:51Z","timestamp":1549171611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637704001038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["S0167637704001038"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.07.008","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}