Applied Mathematics Colloquium
Monday
November 19, 2012
4:15 PM
Multiprocessor Deadline Scheduling for Large Scale Charging of Electric Vehicles
Speaker:
Lang Tong,
Cornell University
Location:
Annenberg 105
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).
Series
Applied Mathematics Colloquium Series
Contact: Sydney Garstang at x4555 sydney@caltech.edu
For more information visit: http://www.acm.caltech.edu