Applied Mathematics Colloquium
Annenberg 105
Multiprocessor Deadline Scheduling for Large Scale Charging of Electric Vehicles
Lang Tong,
Irwin and Joan Jacobs Chair Professor in Engineering,
Cornell University,
We consider the problem of multiprocessor deadline scheduling with the application for the large scale charging of electric vehicles (EVs). In this context, we adopt the idea of network switched charging where chargers are controlled by a scheduler that optimizes the overall operating profit of the service provider.
Under a deterministic model for arbitrary arrivals, charging requests, and service deadlines, competitive ratio is used as a performance measure where an online algorithm is compared with the optimal offline scheduler. We show that the maximum competitive ratio is achieved by a simple algorithm based on the principle of threshold admission and greedy scheduling (TAGS).
Under a deterministic model for arbitrary arrivals, charging requests, and service deadlines, competitive ratio is used as a performance measure where an online algorithm is compared with the optimal offline scheduler. We show that the maximum competitive ratio is achieved by a simple algorithm based on the principle of threshold admission and greedy scheduling (TAGS).
For more information, please contact Sydney Garstang by phone at x4555 or by email at [email protected] or visit http://www.acm.caltech.edu.
Event Series
Applied Mathematics Colloquium Series