{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T09:34:07Z","timestamp":1729676047951,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ipdps.2003.1213410","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"7","source":"Crossref","is-referenced-by-count":0,"title":["Scheduling to minimize flow time metrics"],"prefix":"10.1109","author":[{"given":"L.","family":"Becchetti","sequence":"first","affiliation":[]},{"given":"S.","family":"Leonardi","sequence":"additional","affiliation":[]},{"given":"A.","family":"Marchetti-Spaccamela","sequence":"additional","affiliation":[]},{"given":"G.","family":"Schafer","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380778"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1966.tb01709.x"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0117039"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/262116.262136"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/3-540-68061-6_19","article-title":"On choosing a task assignment policy for a distributed server system","author":"harchol-balter","year":"1998","journal-title":"Lecture Notes in Computer Science 1469"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646123"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237989"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"lenstra","year":"1977","journal-title":"Complexity of machine schedulibg problems Annals of Discrete Mathematics"},{"article-title":"A simpler proof of preemptive total flow time approximation on parallel machines","year":"2002","author":"leonardi","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44666-4_8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380782"},{"key":"ref6","first-page":"548","article-title":"Scheduling to minimize average stretch without migration","author":"becchetti","year":"2000","journal-title":"Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms"},{"article-title":"Smoothed competitive analysis for the multilevel feedback algorithm","year":"2002","author":"becchetti","key":"ref5"},{"journal-title":"Online Computation and Competitive Analysis","year":"1998","author":"borodin","key":"ref8"},{"key":"ref7","first-page":"762","article-title":"Improved algorithms for stretch scheduling","author":"bender","year":"2002","journal-title":"Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Mathematics (SODA-02)"},{"journal-title":"Introduction to Sequencing and Scheduling","year":"1974","author":"baker","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301304"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509954"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258562"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814615"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90151-1"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"}],"event":{"name":"International Parallel and Distributed Processing Symposium (IPDPS 2003)","acronym":"IPDPS-03","location":"Nice, France"},"container-title":["Proceedings International Parallel and Distributed Processing Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8608\/27277\/01213410.pdf?arnumber=1213410","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:26:03Z","timestamp":1497572763000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1213410\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2003.1213410","relation":{},"subject":[]}}