{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T05:49:39Z","timestamp":1777787379862,"version":"3.51.4"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,10,11]],"date-time":"2017-10-11T00:00:00Z","timestamp":1507680000000},"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":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2017,10,11]]},"abstract":"<jats:p>This paper studies the problem of utilizing energy storage systems to perform demand-response in microgrids. The objective is to minimize the operational cost while balancing the supply-and-demand mismatch. The design space is to select and schedule a subset of heterogeneous storage devices that arrive online with different availabilities. Designing a performance-optimized solution is challenging due to the existence of mixed packing and covering constraints in a combinatorial problem, and the essential need for online design. We devise an online algorithm and show that it achieves logarithmic bi-criteria competitive ratio. Experimental results demonstrate the effectiveness of our algorithm.<\/jats:p>","DOI":"10.1145\/3152042.3152062","type":"journal-article","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T12:52:50Z","timestamp":1507812770000},"page":"55-57","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Summary of Recent Results"],"prefix":"10.1145","volume":"45","author":[{"given":"Mohammad H.","family":"Hajiesmaili","sequence":"first","affiliation":[{"name":"The Johns Hopkins University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minghua","family":"Chen","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrique","family":"Mallada","sequence":"additional","affiliation":[{"name":"The Johns Hopkins University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Kin","family":"Chau","sequence":"additional","affiliation":[{"name":"Masdar Institute of Science and Technology, UAE"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,10,11]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627823"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3077839.3077841"},{"key":"e_1_2_1_3_1","volume-title":"Integer Programming and Combinatorial Optimization","author":"Levi Retsef","unstructured":"Retsef Levi , David B Shmoys , and Chaitanya Swamy . 2004. LP-based approximation algorithms for capacitated facility location . In Integer Programming and Combinatorial Optimization . Springer , 206--218. Retsef Levi, David B Shmoys, and Chaitanya Swamy. 2004. LP-based approximation algorithms for capacitated facility location. In Integer Programming and Combinatorial Optimization. Springer, 206--218."},{"key":"e_1_2_1_4_1","volume-title":"The design of approximation algorithms","author":"Williamson David P","unstructured":"David P Williamson and David B Shmoys . 2011. The design of approximation algorithms . Cambridge University Press . David P Williamson and David B Shmoys. 2011. The design of approximation algorithms. Cambridge University Press."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3152042.3152062","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3152042.3152062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:26Z","timestamp":1750213586000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3152042.3152062"}},"subtitle":["Crowd-Sourced Storage-Assisted Demand Response in Microgrids"],"short-title":[],"issued":{"date-parts":[[2017,10,11]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,10,11]]}},"alternative-id":["10.1145\/3152042.3152062"],"URL":"https:\/\/doi.org\/10.1145\/3152042.3152062","relation":{},"ISSN":["0163-5999"],"issn-type":[{"value":"0163-5999","type":"print"}],"subject":[],"published":{"date-parts":[[2017,10,11]]},"assertion":[{"value":"2017-10-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}