{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:00:16Z","timestamp":1750309216938,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T00:00:00Z","timestamp":1154217600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,30]]},"DOI":"10.1145\/1148109.1148124","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"103-112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Minimizing the stretch when scheduling flows of biological requests"],"prefix":"10.1145","author":[{"given":"Arnaud","family":"Legrand","sequence":"first","affiliation":[{"name":"Laboratoire ID-IMAG, France"}]},{"given":"Alan","family":"Su","sequence":"additional","affiliation":[{"name":"Google Inc., Cambridge, MA"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Vivien","sequence":"additional","affiliation":[{"name":"INRIA - LIP, ENS Lyon, France"}]}],"member":"320","published-online":{"date-parts":[[2006,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Introduction to Sequencing and Scheduling","author":"Baker K.","year":"1974","unstructured":"K. Baker . Introduction to Sequencing and Scheduling . Wiley , New York , 1974 . K. Baker. Introduction to Sequencing and Scheduling. Wiley, New York, 1974."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.31.2.381"},{"key":"e_1_3_2_1_3_1","first-page":"270","volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA'98)","author":"Bender M. A.","year":"1998","unstructured":"M. A. Bender , S. Chakrabarti , and S. Muthukrishnan . Flow and stretch metrics for scheduling continuous job streams . In Proceedings of the 9th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA'98) , pages 270 -- 279 . ACM press, 1998 . M. A. Bender, S. Chakrabarti, and S. Muthukrishnan. Flow and stretch metrics for scheduling continuous job streams. In Proceedings of the 9th Annual ACM-SIAM Symposium On Discrete Algorithms (SODA'98), pages 270--279. ACM press, 1998."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545482"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOSH.0000019681.52701.8b"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/16.3.286"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509954"},{"key":"e_1_3_2_1_8_1","unstructured":"GriPPS webpage at http:\/\/gripps.ibcp.fr\/ 2005.  GriPPS webpage at http:\/\/gripps.ibcp.fr\/ 2005."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-566780-7.50020-9"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/791231.792436"},{"key":"e_1_3_2_1_11_1","volume-title":"Oct.","author":"Legrand A.","year":"2005","unstructured":"A. Legrand , A. Su , and F. Vivien . Minimizing the stretch when scheduling flows of biological requests. Research report RR2005-48, \u00c9cole Normale Sup\u00e9rieure de Lyon , Oct. 2005 . A. Legrand, A. Su, and F. Vivien. Minimizing the stretch when scheduling flows of biological requests. Research report RR2005-48, \u00c9cole Normale Sup\u00e9rieure de Lyon, Oct. 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.301"},{"key":"e_1_3_2_1_14_1","volume-title":"Technische Universit\u00e4t Berlin","author":"Megow N.","year":"2002","unstructured":"N. Megow . Performance analysis of on-line algorithms in machine scheduling. Diplomarbeit , Technische Universit\u00e4t Berlin , Apr. 2002 . N. Megow. Performance analysis of on-line algorithms in machine scheduling. Diplomarbeit, Technische Universit\u00e4t Berlin, Apr. 2002."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796508"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1002\/jos.93"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030106"}],"event":{"name":"SPAA06: 18th ACM Symposium on Parallelism in Algorithms and Architectures 2006","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Cambridge Massachusetts USA","acronym":"SPAA06"},"container-title":["Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1148109.1148124","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1148109.1148124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:53Z","timestamp":1750290233000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1148109.1148124"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,30]]},"references-count":16,"alternative-id":["10.1145\/1148109.1148124","10.1145\/1148109"],"URL":"https:\/\/doi.org\/10.1145\/1148109.1148124","relation":{},"subject":[],"published":{"date-parts":[[2006,7,30]]},"assertion":[{"value":"2006-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}