{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:31:47Z","timestamp":1648758707863},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0020-0190(92)90027-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"41-46","source":"Crossref","is-referenced-by-count":0,"title":["An algorithm for flow time minimization and its asymptotic makespan properties"],"prefix":"10.1016","volume":"43","author":[{"given":"Li-Hui","family":"Tsai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90027-S_BIB1","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/361011.361064","article-title":"Scheduling independent tasks to reduce mean finishing time","volume":"17","author":"Bruno","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(92)90027-S_BIB2","first-page":"504","article-title":"Algorithms for minimizing mean flow time","volume":"74","author":"Bruno","year":"1974"},{"key":"10.1016\/0020-0190(92)90027-S_BIB3","year":"1976"},{"key":"10.1016\/0020-0190(92)90027-S_BIB4","first-page":"491","article-title":"Expected makespan for largest-first multiprocessor scheduling","author":"Coffman","year":"1985"},{"key":"10.1016\/0020-0190(92)90027-S_BIB5","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1287\/moor.9.2.260","article-title":"A note on expected makespans for largest-first sequences of independent tasks on two processors","volume":"9","author":"Coffman","year":"1984","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0020-0190(92)90027-S_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263740","article-title":"Algorithms minimizing mean flow time: Schedule-length properties","volume":"6","author":"Coffman","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(92)90027-S_BIB7","first-page":"303","article-title":"The largest exponential spacing","volume":"25","author":"Devroye","year":"1984","journal-title":"Utilitas Math."},{"key":"10.1016\/0020-0190(92)90027-S_BIB8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0167-6377(90)90018-Z","article-title":"Distribution-free bounds on the expectation of the maximum with scheduling applications","volume":"9","author":"Downey","year":"1990","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0020-0190(92)90027-S_BIB9","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1287\/moor.12.2.241","article-title":"the asymptotic optimality of the LPT rule","volume":"12","author":"Frenk","year":"1987","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0020-0190(92)90027-S_BIB10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.26.1.3","article-title":"Performance guarantees for scheduling algorithms","volume":"26","author":"Garey","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/0020-0190(92)90027-S_BIB11","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(92)90027-S_BIB12","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0020-0190(92)90027-S_BIB13","article-title":"the differencing method for set partitioning","author":"Karmarkar","year":"1982"},{"key":"10.1016\/0020-0190(92)90027-S_BIB14","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0304-4149(84)90315-6","article-title":"A strong limit theorem for the oscillation modulus of the uniform empirical quantile process","volume":"17","author":"Mason","year":"1984","journal-title":"Stochastic Process. Appl."},{"key":"10.1016\/0020-0190(92)90027-S_BIB15","author":"Reiss","year":"1989"},{"key":"10.1016\/0020-0190(92)90027-S_BIB16","author":"Serfling","year":"1980"},{"key":"10.1016\/0020-0190(92)90027-S_BIB17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1137\/0221007","article-title":"Asymptotic analysis of an algorithm for balanced parallel-processor scheduling","volume":"21","author":"Tsai","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90027-S_BIB18","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02248591","article-title":"Approximation results in parallel machines stochastic scheduling","volume":"26","author":"Weiss","year":"1990","journal-title":"Ann. Oper. Res."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290027S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290027S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:28:00Z","timestamp":1555144080000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290027S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["002001909290027S"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90027-s","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}