Paper Info
Title
A Distributed Algorithm For Dynamic Break Scheduling In Emergency Service Fleets
Abstract
The quality of service and efficiency of labour utilization in emergency service fleets, such as police, fire departments, and emergency medical services (EMS), depends, among other things, on the efficiency of work break scheduling. The workload of such fleets usually cannot be forecasted with certainty and its urgency requires an immediate response. However, prolonged focused work periods decrease efficiency with related decline of attention and performance. Therefore, break schedule should be regularly updated as the work shift progresses to allow frequent and sufficiently long time for rest. In this paper, we propose a distributed and dynamic work break scheduling algorithm for crews in emergency service vehicle fleets. Based on the historical intervention data, the algorithm rearranges vehicles' crews' work breaks in a manner considering individual crews' preferences. Moreover, it dynamically reallocates stand-by vehicles for best coverage of a region of interest. We analyze the proposed algorithm and show its performance and efficiency on the EMS use-case.
Year
DOI
Venue
2017
10.1007/978-3-319-69131-2_30
PRINCIPLES AND PRACTICE OF MULTI-AGENT SYSTEMS (PRIMA 2017)
Keywords
Field
DocType
Emergency service, Dynamic break scheduling, Dynamic shift scheduling, Vehicle crew assignment, Service operations scheduling
Fair-share scheduling,Workload,Scheduling (computing),Computer science,Quality of service,Work shift,Distributed algorithm,Emergency medical services,Dynamic priority scheduling,Distributed computing
Conference
Volume
ISSN
Citations 
10621
0302-9743
0
PageRank 
References 
Authors
0.34
13
2
Name
Order
Citations
PageRank
Marin Lujak19815.72
Holger Billhardt237236.86