{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:48:42Z","timestamp":1762004922124,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,11]],"date-time":"2018-07-11T00:00:00Z","timestamp":1531267200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"French National Agency for Research","award":["project OATA - ANR-15-CE40-0015-01"],"award-info":[{"award-number":["project OATA - ANR-15-CE40-0015-01"]}]},{"name":"Google Research Award"},{"name":"Hadamard PGMO"},{"name":"DIM RFSI"},{"name":"PSL","award":["project Multi-Fac"],"award-info":[{"award-number":["project Multi-Fac"]}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1617724 CCF-1733873 and CCF-1725661"],"award-info":[{"award-number":["CCF-1617724 CCF-1733873 and CCF-1725661"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,11]]},"DOI":"10.1145\/3210377.3210402","type":"proceedings-article","created":{"date-parts":[[2018,7,12]],"date-time":"2018-07-12T17:46:44Z","timestamp":1531417604000},"page":"291-300","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Online Non-preemptive Scheduling on Unrelated Machines with Rejections"],"prefix":"10.1145","author":[{"given":"Giorgio","family":"Lucarelli","sequence":"first","affiliation":[{"name":"University Grenoble Alpes, CNRS, Inria, Grenoble INP, LIG, Grenoble, France"}]},{"given":"Benjamin","family":"Moseley","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}]},{"given":"Nguyen Kim","family":"Thang","sequence":"additional","affiliation":[{"name":"University of Evry, Universit\u00e9 Paris-Saclay, Evry, France"}]},{"given":"Abhinav","family":"Srivastav","sequence":"additional","affiliation":[{"name":"ENS-Paris & University Paris-Dauphine, Paris, France"}]},{"given":"Denis","family":"Trystram","sequence":"additional","affiliation":[{"name":"University Grenoble Alpes, CNRS, Inria, Grenoble INP, LIG, Grenoble, France"}]}],"member":"320","published-online":{"date-parts":[[2018,7,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49529-2_4"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"S. Anand Naveen Garg and Amit Kumar . 2012. Resource augmentation for weighted flow-time explained by dual fitting Symposium on Discrete Algorithms. 1228--1241.   S. Anand Naveen Garg and Amit Kumar . 2012. Resource augmentation for weighted flow-time explained by dual fitting Symposium on Discrete Algorithms. 1228--1241.","DOI":"10.1137\/1.9781611973099.97"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. 13th Workshop on Models and Algorithms for Planning and Scheduling Problems.","author":"Nikhil Bansal","year":"2017","unstructured":"Nikhil Bansal . 2017 . Some Open Problems in Scheduling . In Proc. 13th Workshop on Models and Algorithms for Planning and Scheduling Problems. Nikhil Bansal . 2017. Some Open Problems in Scheduling. In Proc. 13th Workshop on Models and Algorithms for Planning and Scheduling Problems."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a009"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/1496770.1496846"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1206035.1206038"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380778"},{"key":"e_1_3_2_1_8_1","volume-title":"Symposium on Discrete Algorithms. 1114--1133","author":"Choudhury Anamitra Roy","year":"2015","unstructured":"Anamitra Roy Choudhury , Syamantak Das , Naveen Garg , and Amit Kumar . 2015 . Rejecting jobs to Minimize Load and Maximum Flow-time Proc . Symposium on Discrete Algorithms. 1114--1133 . Anamitra Roy Choudhury, Syamantak Das, Naveen Garg, and Amit Kumar . 2015. Rejecting jobs to Minimize Load and Maximum Flow-time Proc. Symposium on Discrete Algorithms. 1114--1133."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_26"},{"key":"e_1_3_2_1_10_1","volume-title":"Devanur and Zhiyi Huang","author":"Nikhil","year":"2014","unstructured":"Nikhil R. Devanur and Zhiyi Huang . 2014 . Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms Proc. 25th ACM-SIAM Symposium on Discrete Algorithms. Nikhil R. Devanur and Zhiyi Huang . 2014. Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms Proc. 25th ACM-SIAM Symposium on Discrete Algorithms."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1141038.1705261"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/347476.347479"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/312173.312174"},{"key":"e_1_3_2_1_14_1","volume-title":"Abhinav Srivastav, and Denis Trystram .","author":"Lucarelli Giorgio","year":"2016","unstructured":"Giorgio Lucarelli , Nguyen Kim Thang , Abhinav Srivastav, and Denis Trystram . 2016 . Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality European Symposium on Algorithms (ESA) , Vol. Vol. 57 . 1--17. Giorgio Lucarelli, Nguyen Kim Thang, Abhinav Srivastav, and Denis Trystram . 2016. Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality European Symposium on Algorithms (ESA), Vol. Vol. 57. 1--17."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0068-9"},{"key":"e_1_3_2_1_16_1","volume-title":"Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling Proc. 21st European Symposium on Algorithms. 755--766","author":"Thang Nguyen Kim","year":"2013","unstructured":"Nguyen Kim Thang . 2013 . Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling Proc. 21st European Symposium on Algorithms. 755--766 . Nguyen Kim Thang . 2013. Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling Proc. 21st European Symposium on Algorithms. 755--766."},{"key":"e_1_3_2_1_17_1","volume-title":"Online Primal-Dual Algorithms with Configuration Linear Programs. arXiv:1708.04903","author":"Thang Nguyen Kim","year":"2017","unstructured":"Nguyen Kim Thang . 2017. Online Primal-Dual Algorithms with Configuration Linear Programs. arXiv:1708.04903 ( 2017 ). Nguyen Kim Thang . 2017. Online Primal-Dual Algorithms with Configuration Linear Programs. arXiv:1708.04903 (2017)."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/795662.796264"}],"event":{"name":"SPAA '18: 30th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Vienna Austria","acronym":"SPAA '18"},"container-title":["Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210402","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3210377.3210402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:20Z","timestamp":1750210760000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3210377.3210402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,11]]},"references-count":18,"alternative-id":["10.1145\/3210377.3210402","10.1145\/3210377"],"URL":"https:\/\/doi.org\/10.1145\/3210377.3210402","relation":{},"subject":[],"published":{"date-parts":[[2018,7,11]]},"assertion":[{"value":"2018-07-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}