Before revision:  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:  That is , the complexity of obtaining the charging schedule at each time stage is O(1) , which is independent of T. Extensive simulations show that the proposed online algorithm performs very closely to the optimal online algorithm.