Extended Version: Non-Preemptive Scheduling of Flexible Loads in Smart Grids via Convex Optimization

Abstract

This paper studies the scheduling of a large population of non-preemptive flexible electric loads, each of which has a flexible starting time but once started will follow a fixed load shape until completion. We first formulate the scheduling problem as a mixed-integer convex program (MICP), then propose an efficient polynomial time relaxation-adjustment-rounding algorithm for solving the problem. The key novelty of the proposed method lies in its adjustment step, which uses a graph-based algorithm to navigate within the set of optimal points of the convex relaxation while reducing the number of fractional entries in the solution. We establish mathematically that our algorithm yields solutions that are near optimal for a finite number of loads and with its sub-optimality independent of the number of loads. Consequently, the proposed method is asymptotically optimal in a per-load cost sense when the number of loads increases. Despite the gap between the MICP and its convex relaxation, we establish that the solution of the proposed algorithm can be decentralized by marginal prices of the convex relaxation. We also develop and analyze variants of the proposed algorithm for settings with uncertainty and with time-varying realistic load shapes. Finally, we numerically evaluate the proposed algorithm in a case study for the non-preemptive scheduling of electric vehicles charging loads.