{"type":"ScholarlyArticle","title":"Complexity of Scheduling Charging in the Smart Grid","authors":[{"name":"Mathijs de Weerdt","slug":"mathijs-de-weerdt","given":"Mathijs","family":"de Weerdt","affiliation":"Delft University of Technology , Delft , The Netherlands"},{"name":"Michael Albert","slug":"michael-albert","given":"Michael","family":"Albert","affiliation":"Duke University , Durham , North Carolina , USA"},{"name":"Vincent Conitzer","slug":"vincent-conitzer","given":"Vincent","family":"Conitzer","affiliation":"Duke University , Durham , North Carolina , USA"},{"name":"Koos van der Linden","slug":"koos-van-der-linden","given":"Koos","family":"van der Linden","affiliation":"Delft University of Technology , Delft , The Netherlands"}],"abstract":"The problem of optimally scheduling the charging demand of electric vehicles within the constraints of the electricity infrastructure is called the charge scheduling problem. The models of the charging speed, horizon, and charging demand determine the computational complexity of the charge scheduling problem. We show that for about 20 variants the problem is either in P or weakly NP-hard and dynamic programs exist to compute optimal solutions. About 10 other variants of the problem are strongly NP-hard, presenting a potentially significant obstacle to their use in practical situations of scale. An experimental study establishes up to what parameter values the dynamic programs can determine optimal solutions in a couple of minutes.","doi":"10.24963/ijcai.2018/658","url":"https://ijcai.org/proceedings/2018/658","pdf":"https://ijcai.org/proceedings/2018/0658.pdf","markdown":"https://ijcai.org/proceedings/2018/658.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/658","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Planning and Scheduling","track":"Main track","number":658,"pages":{"first":4736,"last":4742},"keywords":["Planning and Scheduling: Theoretical Foundations of Planning","Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Constraints and SAT: Dynamic Programming","Planning and Scheduling: Scheduling"],"videos":[],"references":[{"position":1,"raw":"[Albers, 2009] Susanne Albers. Online Scheduling. In Yves Robert and Frederic Vivien, editors, Introduction to Scheduling, chapter 3, pages 51-73. CRC Press, 2009.","title":"Online Scheduling","authors":"Susanne Albers","year":"2009","venue":"Introduction to Scheduling","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bar-Noy et al., 1995] Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, and Baruch Schieber. Bandwidth allocation with preemption. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pages 616-625, 1995.","title":"Bandwidth allocation with preemption","authors":"Amotz Bar-Noy, Ran Canetti, Shay Kutten, Yishay Mansour, Baruch Schieber","year":"1995","venue":"Proceedings of the 27th Annual ACM Symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Barcelo et al., 2015] Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs, and Michele Scquizzato. On the com- plexity of speed scaling. In Italiano, Pighizzini, and San- nella, editors, Mathematical Foundations of Computer Sci- ence 2015, pages 75-89, 2015.","title":"On the complexity of speed scaling","authors":"Neal Barcelo, Peter Kling, Michael Nugent, Kirk Pruhs, Michele Scquizzato","year":"2015","venue":"Mathematical Foundations of Computer Science 2015","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Blazewicz et al., 1983] Jacek Blazewicz, Jan Karel Lenstra, and A. H. G. Rinnooy Kan. Scheduling subject to resource constraints: classification and complexity. Discrete Ap- plied Mathematics, 5(1):11-24, 1983.","title":"Scheduling subject to resource constraints: classification and complexity","authors":"Jacek Blazewicz, Jan Karel Lenstra, A H G Rinnooy Kan","year":"1983","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Blażewicz et al., 2007] Jacek Blażewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, and Jan Weglarz. Hand- book on scheduling: from theory to applications. Springer Science & Business Media, 2007.","title":"Handbook on scheduling: from theory to applications","authors":"Jacek Blażewicz, Klaus H Ecker, Erwin Pesch, Günter Schmidt, Jan Weglarz","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Brucker, 2007] Peter Brucker. Scheduling algorithms. Springer Verlag, 2007.","title":"Scheduling algorithms","authors":"Peter Brucker","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[de Nijs et al., 2015] Frits de Nijs, Matthijs T. J. Spaan, and Mathijs M. de Weerdt. Best-response planning of ther- mostatically controlled loads under power constraints. In Proceedings of the 29th AAAI Conference on Artificial In- telligence, pages 615-621, 2015.","title":"Best-response planning of thermostatically controlled loads under power constraints","authors":"Frits De Nijs, T J Matthijs, Mathijs M Spaan, De Weerdt","year":"2015","venue":"Proceedings of the 29th AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[García-Villalobos et al., 2014] García-Villalobos, Zamora., San Martín., Asensio, and Aperribay. Plug-in electric ve- hicles in electric distribution networks: A review of smart charging approaches. Renewable and Sustainable Energy Reviews, 38:717-731, 2014.","title":"Plug-in electric vehicles in electric distribution networks: A review of smart charging approaches","authors":"García-Villalobos","year":"2014","venue":"Renewable and Sustainable Energy Reviews","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Hartmann and Briskorn, 2010] Sönke Hartmann and Dirk Briskorn. A survey of variants and extensions of the resource-constrained project scheduling problem. Euro- pean Journal of Operational Research, 207(1):1-14, 2010.","title":"A survey of variants and extensions of the resource-constrained project scheduling problem","authors":"Briskorn Hartmann, Sönke Hartmann, Dirk Briskorn","year":"2010","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Klein, 2000] Robert Klein. Project scheduling with time- varying resource constraints. International Journal of Pro- duction Research, 38(16):3937-3952, 2000.","title":"Project scheduling with timevarying resource constraints","authors":"Robert Klein","year":"2000","venue":"International Journal of Production Research","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Koren and Shasha, 1995] Gilad Koren and Dennis Shasha. D over : An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems. SIAM Jour- nal on Computing, 24(2):318-339, 1995.","title":"D over : An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems","authors":"Koren, Shasha ; ] Gilad Koren, Dennis Shasha","year":"1995","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Ku and Beck, 2016] Wen-Yang Ku and J. Christopher Beck. Mixed integer programming models for job shop schedul- ing: A computational analysis. Computers & Operations Research, 73:165 -173, 2016.","title":"Mixed integer programming models for job shop scheduling: A computational analysis","authors":"Wen-Yang Ku, J Christopher Beck","year":"2016","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Lawler and Martel, 1989] Eugene L. Lawler and Charles U. Martel. Preemptive scheduling of two uniform machines to minimize the number of late jobs. Operations Research, 37(2):314-318, 1989.","title":"Preemptive scheduling of two uniform machines to minimize the number of late jobs","authors":"Eugene L Lawler, Charles U Martel","year":"1989","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lawler, 1983] E. L. Lawler. Recent results in the theory of machine scheduling. In Mathematical programming the state of the art, pages 202-234. Springer, 1983.","title":"Recent results in the theory of machine scheduling","authors":"E L Lawler","year":"1983","venue":"Mathematical programming the state of the art","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lawler, 1990] Eugene L. Lawler. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research, 26(1):125-133, 1990.","title":"A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs","authors":"Eugene L Lawler","year":"1990","venue":"Annals of Operations Research","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Philipsen et al., 2016] Rens Philipsen, Germán Morales- España, Mathijs de Weerdt, and Laurens de Vries. Imper- fect Unit Commitment decisions with perfect information: A real-time comparison of energy versus power. In Power Systems Computation Conference, pages 1-7. IEEE, 2016.","title":"Imperfect Unit Commitment decisions with perfect information: A real-time comparison of energy versus power","authors":"Rens Philipsen, Germán Morales-España, Mathijs De Weerdt, Laurens De Vries","year":"2016","venue":"Power Systems Computation Conference","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Pinedo, 2012] Michael Pinedo. Scheduling: theory, algo- rithms, and systems. Springer Science+ Business Media, 2012.","title":"Scheduling: theory, algorithms, and systems","authors":"Michael Pinedo","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Tang et al., 2014] Wanrong Tang, Suzhi Bi, and Ying Jun Angela Zhang. Online coordinated charging decision algorithm for electric vehicles without future information. IEEE Transactions on Smart Grid, 5(6):2810-2824, 2014.","title":"Online coordinated charging decision algorithm for electric vehicles without future information","authors":"Tang","year":"2014","venue":"IEEE Transactions on Smart Grid","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Vanhoucke and Debels, 2008] Mario Vanhoucke and Dieter Debels. The impact of various activity assumptions on the lead time and resource utilization of resource-constrained projects. Computers & Industrial Engineering, 54(1):140- 154, 2008.","title":"The impact of various activity assumptions on the lead time and resource utilization of resource-constrained projects","authors":"Mario Vanhoucke, Dieter Debels","year":"2008","venue":"Computers & Industrial Engineering","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Yu et al., 2016] Zhe Yu, Shiyao Chen, and Lang Tong. An intelligent energy management system for large-scale charging of electric vehicles. CSEE Journal of Power and Energy Systems, 2(1):47-53, 2016.","title":"An intelligent energy management system for large-scale charging of electric vehicles","authors":"Zhe Yu, Shiyao Chen, Lang Tong","year":"2016","venue":"CSEE Journal of Power and Energy Systems","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}