Complexity of Scheduling Charging in the Smart Grid

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.

[1]  Rens Philipsen,et al.  Imperfect Unit Commitment decisions with perfect information: A real-time comparison of energy versus power , 2016, 2016 Power Systems Computation Conference (PSCC).

[2]  Mathijs de Weerdt,et al.  Best-Response Planning of Thermostatically Controlled Loads under Power Constraints , 2015, AAAI.

[3]  Zhe Yu,et al.  An intelligent energy management system for large-scale charging of electric vehicles , 2016 .

[4]  Robert Klein,et al.  Project scheduling with time-varying resource constraints , 2000 .

[5]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[6]  Philippe Baptiste,et al.  Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times , 1999 .

[7]  Gilbert Laporte,et al.  Annals of Operations Research , 1996 .

[8]  Jacek Blazewicz,et al.  Handbook on Scheduling: From Theory to Applications , 2014 .

[9]  Noam Nisan,et al.  Computationally feasible VCG mechanisms , 2000, EC '00.

[10]  Mario Vanhoucke,et al.  Vlerick Leuven Gent Working Paper Series 2006/15 the Impact of Various Activity Assumptions on the Lead-time and Resource Utilization of Resource-constrained Projects the Impact of Various Activity Assumptions on the Lead-time and Resource Utilization of Resource-constrained Projects Vlerick Leuven , 2022 .

[11]  Sönke Hartmann,et al.  A survey of variants and extensions of the resource-constrained project scheduling problem , 2010, Eur. J. Oper. Res..

[12]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[13]  E. L. Lawler,et al.  A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs , 1991 .

[14]  Jan Karel Lenstra,et al.  Scheduling subject to resource constraints: classification and complexity , 1983, Discret. Appl. Math..

[15]  T. Hawkins.  International Journal of Production Research , 1962, Nature.

[16]  Nicholas R. Jennings,et al.  Efficient mechanisms for the supply of services in multi-agent environments , 1998, ICE '98.

[17]  Gq Huang,et al.  Computers & Industrial Engineering , 2015 .

[18]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[19]  Peter Brucker,et al.  Scheduling Algorithms , 1995 .

[20]  Noam Nisan,et al.  Algorithmic Mechanism Design , 2001, Games Econ. Behav..

[21]  Amritanshu Pandey,et al.  IEEE Transactions on Smart Grid , 2012 .

[22]  L. Goddard,et al.  Operations Research (OR) , 2007 .

[23]  Sanjoy K. Baruah,et al.  On the competitiveness of on-line real-time task scheduling , 2004, Real-Time Systems.

[24]  E. H. Clarke.  Multipart pricing of public goods , 1971 .

[25]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[26]  Ran Canetti,et al.  Bandwidth allocation with preemption , 1995, STOC '95.

[27]  Dennis Shasha,et al.  D^over: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems , 1995, SIAM J. Comput..

[28]  Charles U. Martel,et al.  Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs , 1989, Oper. Res..

[29]  E. L. Lawler,et al.  Recent Results in the Theory of Machine Scheduling , 1982, ISMP.

[30]  Ying Jun Zhang,et al.  Online Coordinated Charging Decision Algorithm for Electric Vehicles Without Future Information , 2013, IEEE Transactions on Smart Grid.

[31]  Yoav Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.

[32]  J. Christopher Beck,et al.  Mixed Integer Programming models for job shop scheduling: A computational analysis , 2016, Comput. Oper. Res..

[33]  Inmaculada Zamora,et al.  Plug-in electric vehicles in electric distribution networks: A review of smart charging approaches , 2014 .