Mathematical programs to schedule service employees at minimum cost represent each feasible schedule, or tour, with an integer variable. In some service organizations, policies governing employee scheduling practices may permit millions of different tours. A common heuristic strategy is to reformulate the problem from a small working subset of the feasible tours. Solution quality depends on the number and types of schedules included in the model. This paper describes a working subset heuristic based on column generation. The method is general and can accommodate a mix of full- and part-time employees. Experiments revealed its formulations had objective values indistinguishable from those of models using all feasible tours, and significantly lower than those generated by alternative working subset procedures.column generation, staffing and scheduling, service operations

Deterministic goal programs for employee scheduling decisions attempt to minimize expected operating costs by assigning the ideal number of employees to each feasible schedule. For each period in the planning horizon, managers must first determine the amount of labor that should be scheduled for duty. These requirements are often established with marginal analysis techniques, which use estimates for incremental labor costs and shortage expenses. spically, each period in the planning horizon is evaluated as an independent epoch. An implicit assumption is that individual employees can be assigned to schedules with as little as a single period of work. If this assumption violates local work rules, the labor requirements parameters for the deterministic goal program may be suboptimal.As we show in this research, this well-known limitation can lead to costly staffing and scheduling errors. We propose an employee scheduling model that overcomes this limitation by integrating the labor requirements and scheduling decisions. Instead of a single, externally determined staffhg goal for each period, the model uses a probability distribution for the quantity of labor required. The model is free to choose an appropriate staffing level for each period, eliminating the need for a separate goal-setting procedure. In most cases this results in better, less costly decisions. In addition, the proposed model easily accommodates both linear and nonlinear under-and overstaffing penalties. We use simple examples to demonstrate many of these advantages and to illustrate the key techniques necessary to implement our model. We also assess its performance in a study of more than 1,700 simulated stochastic employee scheduling problems.

Achieving minimum staffing costs, maximum employee satisfaction with their assigned schedules, and acceptable levels of service are important but potentially conflicting objectives when scheduling service employees. Existing employee scheduling models, such as tour scheduling or general employee scheduling, address at most two of these criteria. This paper describes a heuristic to improve tour scheduling solutions provided by other procedures, and generate a set of equivalent cost feasible alternatives. These alternatives allow managers to identify solutions with attractive secondary characteristics, such as overall employee satisfaction with their assigned tours or consistent employee workloads and customer response times. Tests with both full‐time and mixed work force problems reveal the method improves most nonoptimal initial heuristic solutions. Many of the alternatives generated had more even distributions of surplus staff than the initial solutions, yielding more consistent customer response times and employee workloads. The likelihood of satisfying employee scheduling preferences may also be increased since each alternative provides a different deployment of employees among the available schedules.

No abstract

No abstract