{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:26:23Z","timestamp":1725614783246},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,7,18]]},"DOI":"10.1145\/1073970.1073980","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"56-65","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Windows scheduling of arbitrary length jobs on parallel machines"],"prefix":"10.1145","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[{"name":"Brooklyn College, Brooklyn, NY"}]},{"given":"Richard E.","family":"Ladner","sequence":"additional","affiliation":[{"name":"University of Washington, Seattle, WA"}]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[{"name":"The Interdisciplinary Center, Herzliya, Israel"}]},{"given":"Tammy","family":"VanDeGrift","sequence":"additional","affiliation":[{"name":"University of Portland, Portland, OR"}]}],"member":"320","published-online":{"date-parts":[[2005,7,18]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1109\/98.475988"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1016\/0166-5316(85)90024-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1287\/moor.27.3.518.314"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1137\/S009753970240447X"},{"key":"e_1_3_2_1_5_1","volume-title":"Proceedings of the 14-th ACM-SIAM Symp. on Discrete Algorithms (SODA), 791--800","author":"Bar-Noy A.","year":"2003","unstructured":"A. Bar-Noy , R. E. Ladner , and T. Tamir . Scheduling techniques for media-on-demand . In Proceedings of the 14-th ACM-SIAM Symp. on Discrete Algorithms (SODA), 791--800 , 2003 . A. Bar-Noy, R. E. Ladner, and T. Tamir. Scheduling techniques for media-on-demand. In Proceedings of the 14-th ACM-SIAM Symp. on Discrete Algorithms (SODA), 791--800, 2003."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 15-th ACM-SIAM Symp. on Discrete Algorithms (SODA), 217--226","author":"Bar-Noy A.","year":"2004","unstructured":"A. Bar-Noy , R. E. Ladner , and T. Tamir . Windows scheduling as a restricted version of bin packing . In Proceedings of the 15-th ACM-SIAM Symp. on Discrete Algorithms (SODA), 217--226 , 2004 . A. Bar-Noy, R. E. Ladner, and T. Tamir. Windows scheduling as a restricted version of bin packing. In Proceedings of the 15-th ACM-SIAM Symp. on Discrete Algorithms (SODA), 217--226, 2004."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1023\/A:1024632031440"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/s00446-002-0085-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1007\/BF01940883"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/12.709381"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/571825.571854"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/BF01187034"},{"key":"e_1_3_2_1_13_1","volume-title":"Approximation algorithms for bin packing: a survey. Approximation Algorithms for NP-Hard Problems","author":"Coffman E. G.","year":"1996","unstructured":"E. G. Coffman , M. R. Garey , and D. S. Johnson . Approximation algorithms for bin packing: a survey. Approximation Algorithms for NP-Hard Problems , D. Hochbaum (editor), PWS Publishing , Boston ( 1996 ), 46--93. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: a survey. Approximation Algorithms for NP-Hard Problems, D. Hochbaum (editor), PWS Publishing, Boston (1996), 46--93."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.5555\/545381.545438"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of the 15-th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1041--1049","author":"Evans W. S","year":"2004","unstructured":"W. S Evans , D. G. Kirkpatrick . Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ . In Proc. of the 15-th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1041--1049 , 2004 . W. S Evans, D. G. Kirkpatrick. Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. In Proc. of the 15-th ACM-SIAM Symposium on Discrete Algorithms (SODA), 1041--1049, 2004."},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of SPIE - The International Society of Optical Engineering, 145--156","author":"Feinberg E. A.","year":"2002","unstructured":"E. A. Feinberg , M. Bender , M. Curry , D. Huang , T. Koutsoudis , and J. Bernstein . Sensor resource management for an airborne early warning radar . In Proceedings of SPIE - The International Society of Optical Engineering, 145--156 , 2002 . E. A. Feinberg, M. Bender, M. Curry, D. Huang, T. Koutsoudis, and J. Bernstein. Sensor resource management for an airborne early warning radar. In Proceedings of SPIE - The International Society of Optical Engineering, 145--156, 2002."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1109\/CDC.2003.1271832"},{"key":"e_1_3_2_1_18_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 and Company , San Francisco , 1979 . M.R. Garey and D.S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, W. H. Freeman and Company, San Francisco, 1979."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1109\/ICC.1997.594996"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1007\/s005300100049"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1109\/HICSS.1989.48075"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1016\/0304-3975(92)90365-M"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1023\/A:1009610701409"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1109\/11.632927"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1007\/s00453-002-0990-5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/335305.335398"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/321738.321743"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1016\/0012-365X(80)90269-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1007\/BF02579456"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1007\/s005300050023"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"acronym":"SPAA05","name":"SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005","location":"Las Vegas Nevada USA"},"container-title":["Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073970.1073980","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T02:24:49Z","timestamp":1673144689000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073970.1073980"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,18]]},"references-count":30,"alternative-id":["10.1145\/1073970.1073980","10.1145\/1073970"],"URL":"https:\/\/doi.org\/10.1145\/1073970.1073980","relation":{},"subject":[],"published":{"date-parts":[[2005,7,18]]},"assertion":[{"value":"2005-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}