Before revision:  More importantly, we show that the proposed algorithm can be made scalable when the random process describing the arrival of charging demands is first-order periodic . That is , the complexity of obtaining the charging schedule at each time stage is O(1) and is independent of T. Extensive simulations show that the proposed online algorithm performs very closely to the optimal online algorithm.
After revision:  More importantly, we show that the proposed algorithm can be made scalable when the random process describing the arrival of charging demands is first-order periodic , the complexity of obtaining the charging schedule at each time stage is O(1) and is independent of T. Extensive simulations show that the proposed online algorithm performs very closely to the optimal online algorithm.