Scheduling cooperative emergency response: or how the meek shall overcome the greedy

Authors:
Carol Dottin;Bilal Khan
Affiliations:
John Jay College, CUNY, New York;John Jay College, CUNY, New York
Venue:
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Year:
2009

Citing 2
Cited 0

Adaptive recovery for mobile environments

Communications of the ACM
On the road to recovery: restoring data after disasters

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of scheduling emergency responders to geospatially located finite duration temporally bounded tasks. We consider two different schedulers, Greedy and Meek. schedulers: the Greedy algorithm schedules the closest available qualified emergency responder to a task, while the Meek algorithm, assigns the qualified emergency responder that minimizes the expected future cost of the Greedy algorithm. We show that to be effective emergency response scheduling must take into consideration future costs (as the Meek algorithm does), and not merely instantaneous costs (as the Greedy algorithm does).