A Distributed Algorithm for Dynamic Break Scheduling in Emergency Service Fleets
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.
KeywordsEmergency service Dynamic break scheduling Dynamic shift scheduling Vehicle crew assignment Service operations scheduling
- 1.Bash, B.A., Desnoyers, P.J.: Exact distributed Voronoi cell computation in sensor networks. In: Proceedings of the 6th International Conference on Information Processing in Sensor Networks, pp. 236–243. ACM (2007)Google Scholar
- 7.Chiuso, A., Fagnani, F., Schenato, L., Zampieri, S.: Gossip algorithms for distributed ranking. In: American Control Conference (ACC), 2011, pp. 5468–5473. IEEE (2011)Google Scholar
- 9.Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., Slany, W.: Automated shift design and break scheduling. In: Uyar, A., Ozcan, E., Urquhart, N. (eds.) Automated Scheduling and Planning. SCI, vol. 505, pp. 109–127. Springer, Heidelberg (2013). doi: 10.1007/978-3-642-39304-4_5 CrossRefGoogle Scholar