{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:06:40Z","timestamp":1757617600896,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610891"},{"type":"electronic","value":"9789819610907"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1090-7_29","type":"book-chapter","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T16:33:23Z","timestamp":1741106003000},"page":"359-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Trade-Off Between Maximum Flow Time and\u00a0Energy Intake in\u00a0EV Charging"],"prefix":"10.1007","author":[{"given":"Xinru","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sijia","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinxin","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miao","family":"Shang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yicheng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"29_CR1","unstructured":"Gridserve. Accessed 28 Mar 2024. https:\/\/www.gridserve.com\/2024\/03\/26\/the-best-and-worst-time-of-day-to-charge-on-the-gridserve-electric-highway\/"},{"key":"29_CR2","unstructured":"Osprey. Accessed 28 Mar 2024. https:\/\/www.ospreycharging.co.uk\/post\/what-is-a-charging-curve"},{"key":"29_CR3","unstructured":"StateGrid. Accessed 28 Mar 2024. http:\/\/www.zgjx.cn\/2023-10\/31\/c_13107-46015_3.html"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-39206-1_2","volume-title":"Automata, Languages, and Programming","author":"S Anand","year":"2013","unstructured":"Anand, S., Bringmann, K., Friedrich, T., Garg, N., Kumar, A.: Minimizing maximum (weighted) flow-time on related and unrelated machines. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013. LNCS, vol. 7965, pp. 13\u201324. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39206-1_2"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Anand, S., Garg, N., Kumar, A.: Resource augmentation for weighted flow-time explained by dual fitting. In: Proceedings of the 2012 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1228\u20131241. SIAM (2012)","DOI":"10.1137\/1.9781611973099.97"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Azar, Y., Epstein, A.: Convex programming for scheduling unrelated parallel machines. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC), pp. 331\u2013337 (2005)","DOI":"10.1145\/1060590.1060639"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2016.v012a014","volume":"12","author":"N Bansal","year":"2016","unstructured":"Bansal, N.: Minimizing maximum flow-time on related machines. Theory Comput. 12(1), 1\u201314 (2016)","journal-title":"Theory Comput."},{"key":"29_CR8","doi-asserted-by":"publisher","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: complexity, algorithms and approximability. In: Du, DZ., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. 3, pp. 1493\u20131641 (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_25","DOI":"10.1007\/978-1-4613-0303-9_25"},{"key":"29_CR9","unstructured":"Eden, A., Feldman, M., Fiat, A., Taub, T.: Truthful prompt scheduling for minimizing sum of completion times. In: 26th Annual European Symposium on Algorithms (ESA), pp. 27:1\u201327:14 (2018)"},{"issue":"6","key":"29_CR10","doi-asserted-by":"publisher","first-page":"1458","DOI":"10.1109\/72.883477","volume":"11","author":"MN Gibbs","year":"2000","unstructured":"Gibbs, M.N., MacKay, D.J.: Variational Gaussian process classifiers. IEEE Trans. Neural Networks 11(6), 1458\u20131464 (2000)","journal-title":"IEEE Trans. Neural Networks"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-59497-3_175","volume-title":"From Natural to Artificial Neural Computation","author":"J Han","year":"1995","unstructured":"Han, J., Moraga, C.: The influence of the sigmoid function parameters on the speed of backpropagation learning. In: Mira, J., Sandoval, F. (eds.) IWANN 1995. LNCS, vol. 930, pp. 195\u2013201. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59497-3_175"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Im, S., Li, S.: Improved approximations for unrelated machine scheduling. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2917\u20132946. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch111"},{"key":"29_CR13","unstructured":"Im, S., Moseley, B., Pruhs, K., Stein, C.: Minimizing maximum flow time on related machines via dynamic posted pricing. In: 25th Annual European Symposium on Algorithms (ESA), pp. 51:1\u201351:10 (2017)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Im, S., Shadloo, M.: Weighted completion time minimization for unrelated machines via iterative fair contention resolution. In: Proceedings of the 2020 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2790\u20132809. SIAM (2020)","DOI":"10.1137\/1.9781611975994.170"},{"issue":"5","key":"29_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1552285.1552289","volume":"56","author":"VSA Kumar","year":"2009","unstructured":"Kumar, V.S.A., Marathe, M.V., Parthasarathy, S., Srinivasan, A.: A unified approach to scheduling on unrelated parallel machines. J. ACM 56(5), 1\u201331 (2009)","journal-title":"J. ACM"},{"issue":"12","key":"29_CR16","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/10.250574","volume":"40","author":"Y Ling","year":"1993","unstructured":"Ling, Y., He, B.: Entropic analysis of biological growth models. IEEE Trans. Biomed. Eng. 40(12), 1193\u20131200 (1993)","journal-title":"IEEE Trans. Biomed. Eng."},{"issue":"02","key":"29_CR17","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1142\/S0129054104002480","volume":"15","author":"M Mastrolilli","year":"2004","unstructured":"Mastrolilli, M.: Scheduling to minimize max flow time: off-line and on-line algorithms. Int. J. Found. Comput. Sci. 15(02), 385\u2013401 (2004)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"29_CR18","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.procs.2018.10.158","volume":"141","author":"A Nait-Sidi-Moh","year":"2018","unstructured":"Nait-Sidi-Moh, A., Ruzmetov, A., Bakhouya, M., Naitmalek, Y., Gaber, J.: A prediction model of electric vehicle charging requests. Procedia Comput. Sci. 141, 127\u2013134 (2018)","journal-title":"Procedia Comput. Sci."},{"key":"29_CR19","doi-asserted-by":"publisher","unstructured":"Pinedo, M.L.: Scheduling, vol.\u00a029. Springer, Cham (2012). https:\/\/doi.org\/10.1007\/978-3-031-05921-6","DOI":"10.1007\/978-3-031-05921-6"},{"key":"29_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2021.118382","volume":"309","author":"S Powell","year":"2022","unstructured":"Powell, S., Cezar, G.V., Rajagopal, R.: Scalable probabilistic estimates of electric vehicle charging given observed driver behavior. Appl. Energy 309, 118382 (2022)","journal-title":"Appl. Energy"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1090-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T07:34:31Z","timestamp":1757144071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1090-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610891","9789819610907"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1090-7_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"5 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}