IMPLICIT OPTIMAL AND HEURISTIC LABOR STAFFING IN A MULTIOBJECTIVE,MULTILOCATION ENVIRONMENT*

This paper presents a tractable set of integer programming models for the days-off scheduling of a mix of full- and part-time employees working α to β days/week (cycle) in a multiple-objective, multiple-location environment. Previous models were formulated to specifically schedule part-time employees working either two or three days per week. These models were intractable because they required complete employee schedule information. The new models are deemed implicit optimal since they are required to supply only essential information. While the number of variables in previous models is an exponential increasing function of β-α, the size of three of the new models is independent of α and β. The first three models developed here (as in [18]) deal with the trade-offs between idle time, the number of employees required to work at multiple “locations,” and the size of the total labor pool. The inherent flexibility of the implicit modeling approach is illustrated by the presentation of various modifications of the basic models. These modifications permit the use of preference weights on the number of employee work days/week (cycle) or the minimization of payroll costs where differential pay rates exist. These latter models may also be formulated such that idle time is ignored, constrained or minimized. The execution time for the implicit models (on a CDC CYBER 730 computer with commercially available software) averaged well under five seconds on 1200 trial problems for the type of application considered in [18]. A solution was obtained in less than 46 seconds of CPU time for a trial problem which would have required over 1.4 million integer variables with previous models. The availability of optimal solutions was invaluable in the development of two heuristics designed to deal with the trade-offs of [16]. In an experimental analysis a previous heuristic produced results which averaged from 74 to 508 percent above optimum across six experimental conditions. The comparable new heuristic produced results which averaged from 3 to 8 percent above optimum for the same experimental conditions. The paper concludes by developing a framework to integrate the results of this research with the tour scheduling problem and by identifying several other areas for related research.