We developed a method for workforce scheduling that models both the structure of the set of permissible shifts, and the stochastic and time-varying demand process. A prototype implementation uses a genetic algorithm to search for good schedules, and evaluates the service level resulting from a...

This paper addresses the problem of scheduling ambulance crews in order to maximize the coverage throughout a planning horizon. The problem includes the subproblem of locating ambulances to maximize expected coverage with probabilistic response times, for which a tabu search algorithm is...

We describe a method to find low cost employee shift schedules that guarantee that the fraction of customers who wait less than a specified time (the service level) is always at or above a specified minimum. Most previous approaches used a two-step procedure: (1) determine period-by-period...

We developed a method for workforce scheduling that models both the structure of the set of permissible shifts, and the stochastic and time-varying demand process. A prototype implementation uses a genetic algorithm to search for good schedules, and evaluates the service level resulting from a...