We describe a method to find low cost shift schedules with a time-varying service level that is always above a specified minimum. Most previous approaches used a two-step procedure: (1) determine staffing requirements and (2) find a minimum cost schedule that provides the required staffing in...

Motivated by the dispatching of trucks to shovels in surface mines, we study optimal routing in a Markovian finite-source, multi-server queueing system with heterogeneous servers, each with a separate queue. We formulate the problem of routing customers to servers to maximize the system...

Using administrative data for high-priority calls in Calgary, Alberta, we estimate how ambulance travel times depend on distance. We find that a logarithmic transformation produces symmetric travel-time distributions with heavier tails than those of a normal distribution. Guided by nonparametric...