Queues with Rechargeable Servers

Abstract

Drone delivery systems violate a core assumption in classical queueing models: server capacity is not fixed. Drones (servers) periodically must recharge, creating random fluctuations in service availability. We introduce an Erlang--S$^{*}$ queue that incorporates charging dynamics (probability of charging after service completion $p$ and charging return rate $\gamma$) together with abandonment. We derive fluid and diffusion limits, yielding closed-form steady-state means, variances, and covariances for the joint queue--server process $(Q,S)$. The diffusion limits allow us to derive new staffing rules for the probability of delay and the probability of abandonment targets. A key insight is that server stochasticity induces systematic capacity loss relative to fixed--server systems, leading to a regime--dependent staffing adjustment: additive shifts in underloaded regimes and multiplicative scaling in overloaded regimes. Our simulation experiments confirm both the accuracy of the limit theorems and the performance of the staffing schedule's ability to achieve their targets.