{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T12:57:30Z","timestamp":1790773050349,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:00:00Z","timestamp":1181347200000},"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":[[2007,6,9]]},"DOI":"10.1145\/1248377.1248383","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T16:07:37Z","timestamp":1189786057000},"page":"25-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Approximation algorithms for multiprocessor scheduling under uncertainty"],"prefix":"10.1145","author":[{"given":"Guolong","family":"Lin","sequence":"first","affiliation":[{"name":"Akamai Technologies, Cambridge, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2007,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.3.2.149"},{"key":"e_1_3_2_1_2_1","volume-title":"Introduction to Linear Optimization","author":"Bertsimas D.","year":"1997","unstructured":"D. Bertsimas and J. Tsitsiklis . Introduction to Linear Optimization . Athena Scientific , 1997 . D. Bertsimas and J. Tsitsiklis. Introduction to Linear Optimization. Athena Scientific, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0987"},{"key":"e_1_3_2_1_5_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . MIT Press and McGraw-Hill Book Company , Cambridge, MA , second edition, 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. MIT Press and McGraw-Hill Book Company, Cambridge, MA, second edition, 2001."},{"key":"e_1_3_2_1_6_1","volume-title":"7th Industrial Engineering Research Conference Proceedings","author":"Fernandez A.","year":"1998","unstructured":"A. Fernandez , R. Armacost , and J. Pet-Edwards . A model for the resource constrained project scheduling problem with stochastic task durations . In 7th Industrial Engineering Research Conference Proceedings , 1998 . A. Fernandez, R. Armacost, and J. Pet-Edwards. A model for the resource constrained project scheduling problem with stochastic task durations. In 7th Industrial Engineering Research Conference Proceedings, 1998."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/10429247.1998.11415002"},{"key":"e_1_3_2_1_8_1","volume-title":"Flows in Networks","author":"Ford L. R.","year":"1962","unstructured":"L. R. Ford , Jr. and D. R. Fulkerson . Flows in Networks . Princeton University Press , Princeton , 1962 . L. R. Ford, Jr. and D. R. Fulkerson. Flows in Networks. Princeton University Press, Princeton, 1962."},{"key":"e_1_3_2_1_9_1","volume-title":"The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann","author":"Foster I.","year":"2004","unstructured":"I. Foster and C. Kesselman , editors . The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann , San Francisco, CA , 2 nd edition, 2004 . I. Foster and C. Kesselman, editors. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco, CA, 2nd edition, 2004.","edition":"2"},{"key":"e_1_3_2_1_10_1","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"Garey M. R.","year":"1979","unstructured":"M. R. Garey and D. S. Johnson . Computers and Intractability: A guide to the theory of NP-completeness . W. H. Freeman , San Francisco , 1979 . M. R. Garey and D. S. Johnson. Computers and Intractability: A guide to the theory of NP-completeness. W. H. Freeman, San Francisco, 1979."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796473"},{"key":"e_1_3_2_1_12_1","volume-title":"Bounds for certain multiprocessing anomalies. Bell System Technical Journal (BSTJ), 45:1563--1581","author":"Graham R. L.","year":"1966","unstructured":"R. L. Graham . Bounds for certain multiprocessing anomalies. Bell System Technical Journal (BSTJ), 45:1563--1581 , 1966 . R. L. Graham. Bounds for certain multiprocessing anomalies. Bell System Technical Journal (BSTJ), 45:1563--1581, 1966."},{"key":"e_1_3_2_1_13_1","volume-title":"Approximation Algorithms for NP-hard Problems","author":"Hall L.","year":"1997","unstructured":"L. Hall . Approximation algorithms for scheduling . In D. Hochbaum, editor, Approximation Algorithms for NP-hard Problems , PWS Publishing Company . 1997 . L. Hall. Approximation algorithms for scheduling. In D. Hochbaum, editor, Approximation Algorithms for NP-hard Problems, PWS Publishing Company. 1997."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.04.002"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728178"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797329142"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_13"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01215349"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585745"},{"key":"e_1_3_2_1_21_1","volume-title":"March","author":"Lin G.","year":"2007","unstructured":"G. Lin and R. Rajaraman . Approximation algorithms for multiprocessor scheduling under uncertainty. Technical report, arXiv , March 2007 . http:\/\/arxiv.org\/abs\/cs\/0703100. G. Lin and R. Rajaraman. Approximation algorithms for multiprocessor scheduling under uncertainty. Technical report, arXiv, March 2007. http:\/\/arxiv.org\/abs\/cs\/0703100."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1073981"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90003-7"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22154"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019223872X"},{"key":"e_1_3_2_1_27_1","series-title":"Interscience Series in Discrete Mathematics and Optimization","volume-title":"Theory of linear and integer programming","author":"Schrijver A.","year":"1986","unstructured":"A. Schrijver . Theory of linear and integer programming . Interscience Series in Discrete Mathematics and Optimization . Wiley , 1986 . A. Schrijver. Theory of linear and integer programming. Interscience Series in Discrete Mathematics and Optimization. Wiley, 1986."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979222676X"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/375827.375840"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365543"}],"event":{"name":"SPAA07: 19th ACM Symposium on Parallelism in Algorithms and Architectures","location":"San Diego California USA","acronym":"SPAA07","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1248377.1248383","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1248377.1248383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:25Z","timestamp":1750258285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1248377.1248383"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,9]]},"references-count":29,"alternative-id":["10.1145\/1248377.1248383","10.1145\/1248377"],"URL":"https:\/\/doi.org\/10.1145\/1248377.1248383","relation":{},"subject":[],"published":{"date-parts":[[2007,6,9]]},"assertion":[{"value":"2007-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}