{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:18:28Z","timestamp":1743002308918,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030394783"},{"type":"electronic","value":"9783030394790"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39479-0_15","type":"book-chapter","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T15:03:47Z","timestamp":1579878227000},"page":"217-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Greedy Is Optimal for Online Restricted Assignment and Smart Grid Scheduling for Unit Size Jobs"],"prefix":"10.1007","author":[{"given":"Fu-Hong","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0194-9360","authenticated-orcid":false,"given":"Hsiang-Hsuan","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7935-7245","authenticated-orcid":false,"given":"Prudence W. H.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,25]]},"reference":[{"key":"15_CR1","unstructured":"Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling. In: SODA, pp. 493\u2013500 (1997)"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S.A., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. J. ACM 44(3), 486\u2013504 (1997)","journal-title":"J. ACM"},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/BFb0029569","volume-title":"Online Algorithms","author":"Y Azar","year":"1998","unstructured":"Azar, Y.: On-line load balancing. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms. LNCS, vol. 1442, pp. 178\u2013195. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0029569"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(94)90153-8","volume":"130","author":"Y Azar","year":"1994","unstructured":"Azar, Y., Broder, A.Z., Karlin, A.R.: On-line load balancing. Theor. Comput. Sci. 130(1), 73\u201384 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.jalgor.2004.02.003","volume":"52","author":"Y Azar","year":"2004","unstructured":"Azar, Y., Epstein, L., Richter, Y., Woeginger, G.J.: All-norm approximation algorithms. J. Algorithms 52(2), 120\u2013133 (2004)","journal-title":"J. Algorithms"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1006\/jagm.1995.0799","volume":"22","author":"Y Azar","year":"1997","unstructured":"Azar, Y., Kalyanasundaram, B., Plotkin, S.A., Pruhs, K., Waarts, O.: On-line load balancing of temporary tasks. J. Algorithms 22(1), 93\u2013110 (1997)","journal-title":"J. Algorithms"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/jagm.1995.1008","volume":"18","author":"Y Azar","year":"1995","unstructured":"Azar, Y., Naor, J., Rom, R.: The competitiveness of on-line assignments. J. Algorithms 18(2), 221\u2013237 (1995)","journal-title":"J. Algorithms"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y Bartal","year":"1995","unstructured":"Bartal, Y., Fiat, A., Karloff, H.J., Vohra, R.: New algorithms for an ancient scheduling problem. J. Comput. Syst. Sci. 51(3), 359\u2013366 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"15_CR9","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"issue":"6","key":"15_CR10","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s10951-015-0447-8","volume":"19","author":"M Burcea","year":"2016","unstructured":"Burcea, M., Hon, W., Liu, H., Wong, P.W.H., Yau, D.K.Y.: Scheduling for electricity cost in a smart grid. J. Sched. 19(6), 687\u2013699 (2016)","journal-title":"J. Sched."},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Caron, S., Kesidis, G.: Incentive-based energy consumption scheduling algorithms for the smart grid. In: SmartGridComm, pp. 391\u2013396. IEEE (2010)","DOI":"10.1109\/SMARTGRID.2010.5622073"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-77404-6_23","volume-title":"LATIN 2018: Theoretical Informatics","author":"V Chau","year":"2018","unstructured":"Chau, V., Feng, S., Thang, N.K.: Competitive algorithms for demand response management in smart grid. In: Bender, M.A., Farach-Colton, M., Mosteiro, M.A. (eds.) LATIN 2018. LNCS, vol. 10807, pp. 303\u2013316. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-77404-6_23"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1109\/TSG.2012.2224388","volume":"4","author":"C Chen","year":"2013","unstructured":"Chen, C., Nagananda, K.G., Xiong, G., Kishore, S., Snyder, L.V.: A communication-based appliance scheduling scheme for consumer-premise energy management systems. IEEE Trans. Smart Grid 4(1), 56\u201365 (2013)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/s00453-012-9668-9","volume":"68","author":"T Ebenlendr","year":"2014","unstructured":"Ebenlendr, T., Krc\u00e1l, M., Sgall, J.: Graph balancing: a special case of scheduling unrelated parallel machines. Algorithmica 68(1), 62\u201380 (2014)","journal-title":"Algorithmica"},{"key":"15_CR15","unstructured":"European Commission: Europen smartgrids technology platform (2006). \nftp:\/\/ftp.cordis.europa.eu\/pub\/fp7\/energy\/docs\/smartgrids_en.pdf"},{"issue":"4","key":"15_CR16","doi-asserted-by":"publisher","first-page":"944","DOI":"10.1109\/SURV.2011.101911.00087","volume":"14","author":"X Fang","year":"2012","unstructured":"Fang, X., Misra, S., Xue, G., Yang, D.: Smart grid - the new and improved power grid: a survey. IEEE Commun. Surv. Tutorials 14(4), 944\u2013980 (2012)","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"1","key":"15_CR17","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/MPE.2009.934876","volume":"8","author":"H Farhangi","year":"2010","unstructured":"Farhangi, H.: The path of the smart grid. IEEE Power Energy Mag. 8(1), 18\u201328 (2010)","journal-title":"IEEE Power Energy Mag."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/978-3-319-26626-8_58","volume-title":"Combinatorial Optimization and Applications","author":"X Feng","year":"2015","unstructured":"Feng, X., Xu, Y., Zheng, F.: Online scheduling for electricity cost in smart grid. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 783\u2013793. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-26626-8_58"},{"issue":"9","key":"15_CR19","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","volume":"45","author":"RL Graham","year":"1966","unstructured":"Graham, R.L.: Bounds for certain multiprocessing anomalies. Bell Syst. Tech. J. 45(9), 1563\u20131581 (1966)","journal-title":"Bell Syst. Tech. J."},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham, R.L.: Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17(2), 416\u2013429 (1969)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"15_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/MPE.2010.936352","volume":"8","author":"K Hamilton","year":"2010","unstructured":"Hamilton, K., Gulhar, N.: Taking demand response to the next level. IEEE Power Energy Mag. 8(3), 60\u201365 (2010)","journal-title":"IEEE Power Energy Mag."},{"issue":"44\u201346","key":"15_CR22","doi-asserted-by":"publisher","first-page":"3947","DOI":"10.1016\/j.tcs.2010.08.008","volume":"411","author":"Y Huo","year":"2010","unstructured":"Huo, Y., Leung, J.Y.: Fast approximation algorithms for job scheduling with processing set restrictions. Theor. Comput. Sci. 411(44\u201346), 3947\u20133955 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"15_CR23","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MPE.2008.931384","volume":"7","author":"A Ipakchi","year":"2009","unstructured":"Ipakchi, A., Albuyeh, F.: Grid of the future. IEEE Power Energy Mag. 7(2), 52\u201362 (2009)","journal-title":"IEEE Power Energy Mag."},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Kannberg, L., Chassin, D., DeSteese, J., Hauser, S., Kintner-Meyer, M., (U.S.), P.N.N.L., of Energy, U.S.D.: GridWise: The Benefits of a Transformed Energy System. Pacific Northwest National Laboratory (2003)","DOI":"10.2172\/15010370"},{"issue":"1\u20132","key":"15_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ipl.2012.09.004","volume":"113","author":"SG Kolliopoulos","year":"2013","unstructured":"Kolliopoulos, S.G., Moysoglou, Y.: The 2-valued case of makespan minimization with assignment constraints. Inf. Process. Lett. 113(1\u20132), 39\u201343 (2013)","journal-title":"Inf. Process. Lett."},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Koutsopoulos, I., Tassiulas, L.: Control and optimization meet the smart power grid: scheduling of power demands for optimal energy management. In: E-Energy, pp. 41\u201350. ACM (2011)","DOI":"10.1145\/2318716.2318723"},{"issue":"2","key":"15_CR27","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1109\/MPE.2007.915179","volume":"6","author":"R Krishnan","year":"2008","unstructured":"Krishnan, R.: Meters of tomorrow [in my view]. IEEE Power Energy Mag. 6(2), 94\u201396 (2008)","journal-title":"IEEE Power Energy Mag."},{"issue":"1\u20132","key":"15_CR28","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0304-3975(00)00392-3","volume":"270","author":"TW Lam","year":"2002","unstructured":"Lam, T.W., Ting, H., To, K., Wong, P.W.H.: On-line load balancing of temporary tasks revisited. Theor. Comput. Sci. 270(1\u20132), 325\u2013340 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"15_CR29","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.ipl.2009.09.015","volume":"110","author":"K Lee","year":"2009","unstructured":"Lee, K., Leung, J.Y., Pinedo, M.L.: A note on graph balancing problems with restrictions. Inf. Process. Lett. 110(1), 24\u201329 (2009)","journal-title":"Inf. Process. Lett."},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J.K., Shmoys, D.B., Tardos, \u00c9.: Approximation algorithms for scheduling unrelated parallel machines. Math. Program. 46, 259\u2013271 (1990)","journal-title":"Math. Program."},{"key":"15_CR31","unstructured":"Liu, F., Liu, H., Wong, P.W.H.: Optimal nonpreemptive scheduling in a smart grid model. CoRR abs\/1602.06659 (2016)"},{"key":"15_CR32","unstructured":"Liu, F., Liu, H., Wong, P.W.H.: Optimal nonpreemptive scheduling in a smart grid model. In: ISAAC, pp. 53:1\u201353:13, LIPIcs (2016)"},{"key":"15_CR33","unstructured":"Lockheed Martin: SEELoad\u2122 Solution. \nhttp:\/\/www.lockheedmartin.co.uk\/us\/products\/energy-solutions\/seesuite\/seeload.html"},{"issue":"3","key":"15_CR34","doi-asserted-by":"publisher","first-page":"1244","DOI":"10.1109\/TSG.2012.2195686","volume":"3","author":"T Logenthiran","year":"2012","unstructured":"Logenthiran, T., Srinivasan, D., Shun, T.Z.: Demand side management in smart grid using heuristic optimization. IEEE Trans. Smart Grid 3(3), 1244\u20131252 (2012)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"3","key":"15_CR35","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1109\/MPE.2010.936353","volume":"8","author":"T Lui","year":"2010","unstructured":"Lui, T., Stirling, W., Marcy, H.: Get smart. IEEE Power Energy Mag. 8(3), 66\u201378 (2010)","journal-title":"IEEE Power Energy Mag."},{"issue":"1","key":"15_CR36","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/TSG.2012.2223766","volume":"4","author":"S Maharjan","year":"2013","unstructured":"Maharjan, S., Zhu, Q., Zhang, Y., Gjessing, S., Basar, T.: Dependable demand response management in the smart grid: a stackelberg game approach. IEEE Trans. Smart Grid 4(1), 120\u2013132 (2013)","journal-title":"IEEE Trans. Smart Grid"},{"key":"15_CR37","volume-title":"Renewable and Efficient Electric Power Systems","author":"GM Masters","year":"2013","unstructured":"Masters, G.M.: Renewable and Efficient Electric Power Systems. Wiley, Hoboken (2013)"},{"issue":"3","key":"15_CR38","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1109\/TSG.2010.2089069","volume":"1","author":"AH Mohsenian-Rad","year":"2010","unstructured":"Mohsenian-Rad, A.H., Wong, V.W., Jatskevich, J., Schober, R., Leon-Garcia, A.: Autonomous demand-side management based on game-theoretic energy consumption scheduling for the future smart grid. IEEE Trans. Smart Grid 1(3), 320\u2013331 (2010)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"1","key":"15_CR39","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.orl.2009.09.010","volume":"38","author":"G Muratore","year":"2010","unstructured":"Muratore, G., Schwarz, U.M., Woeginger, G.J.: Parallel machine scheduling with nested job assignment restrictions. Oper. Res. Lett. 38(1), 47\u201350 (2010)","journal-title":"Oper. Res. Lett."},{"key":"15_CR40","unstructured":"REGEN Energy Inc: ENVIROGRID\u2122 SMART GRID BUNDLE. \nhttp:\/\/www.regenenergy.com\/press\/announcing-the-envirogrid-smart-grid-bundle\/"},{"issue":"1","key":"15_CR41","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1109\/TSG.2012.2214068","volume":"4","author":"S Salinas","year":"2013","unstructured":"Salinas, S., Li, M., Li, P.: Multi-objective optimal energy consumption scheduling in smart grids. IEEE Trans. Smart Grid 4(1), 341\u2013348 (2013)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"5","key":"15_CR42","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1137\/110851201","volume":"41","author":"O Svensson","year":"2012","unstructured":"Svensson, O.: Santa claus schedules jobs on unrelated machines. SIAM J. Comput. 41(5), 1318\u20131341 (2012)","journal-title":"SIAM J. Comput."},{"key":"15_CR43","unstructured":"Toronto Hydro Corporation: Peaksaver Program. \nhttp:\/\/www.peaksaver.com\/peaksaver_THESL.html"},{"key":"15_CR44","unstructured":"UK Department of Energy & Climate Change: Smart grid: a more energy-efficient electricity supply for the UK (2013). \nhttps:\/\/www.gov.uk\/smart-grid-a-more-energy-efficient-electricity-supply-for-the-uk"},{"key":"15_CR45","unstructured":"US Department of Energy: The Smart Grid: An Introduction (2009). \nhttp:\/\/www.oe.energy.gov\/SmartGridIntroduction.htm"},{"issue":"4","key":"15_CR46","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10951-013-0359-4","volume":"17","author":"J Verschae","year":"2014","unstructured":"Verschae, J., Wiese, A.: On the configuration-LP for scheduling on unrelated machines. J. Sched. 17(4), 371\u2013383 (2014)","journal-title":"J. Sched."},{"issue":"11","key":"15_CR47","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ipl.2016.06.007","volume":"116","author":"C Wang","year":"2016","unstructured":"Wang, C., Sitters, R.: On some special cases of the restricted assignment problem. Inf. Process. Lett. 116(11), 723\u2013728 (2016)","journal-title":"Inf. Process. Lett."},{"key":"15_CR48","unstructured":"Zpryme Research & Consulting: Power systems of the future: the case for energy storage, distributed generation, and microgrids (2012). \nhttp:\/\/smartgrid.ieee.org\/images\/features\/smart_grid_survey.pdf"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39479-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,12]],"date-time":"2020-03-12T04:05:02Z","timestamp":1583985902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39479-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030394783","9783030394790"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39479-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"25 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2019.ak.in.tum.de\/index.php\/menue-waoa\/waoa-overview","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}