The min-Shift Design problem (MSD) is an important scheduling problem that needs to be solved in many industrial contexts. The issue is to find a minimum number of shifts and the number of employees to be assigned to these shifts in order to minimize the deviation from workforce requirements.
Our research considers both theoretical and practical aspects of the min-Shift Design problem. This problem is closely related to the minimum edge-cost flow problem (MECF), a network flow variant that has many applications beyond shift scheduling. We show that MSD reduces to a special case of MECF and, exploiting this reduction, we prove a logarithmic hardness of approximation lower bound for MSD. On the basis of these results, we propose a hybrid heuristic for the problem, which relies on a greedy heuristic followed by a local search algorithm. The greedy part is based on the network flow analogy, and the local search algorithm makes use of multiple neighborhood relations.
An experimental analysis on structured random instances shows that the hybrid heuristic clearly outperforms our previous commercial implementation. Furthermore, it highlights the respective merits of the composing heuristics for different performance parameters.
KeywordsWorkforce scheduling Hybrid algorithms Local search Greedy heuristics
Unable to display preview. Download preview PDF.
- Aarts, E., & Lenstra, J. K. (Eds.). (1997). Local search in combinatorial optimization. New York: Wiley. Google Scholar
- Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1993). Network flows, Englewood Cliffs: Prentice-Hall. Google Scholar
- Bartholdi, J., Orlin, J., & Ratliff, H. (1980). Cyclic scheduling via integer programs with circular ones. Operations Research, 28, 110–118. Google Scholar
- Garey, M. R., & Johnson, D. S. (1979). Computers and intractability—a guide to NP-completeness. San Francisco: W.H. Freeman. Google Scholar
- Gärtner, J., Musliu, N., & Slany, W. (2001). Rota: a research project on algorithms for workforce scheduling and shift design optimization. AI Communications: The European Journal on Artificial Intelligence, 14(2), 83–92. Google Scholar
- Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic. ISBN 0-7923-9965-X. Google Scholar
- Hochbaum, D. (2000). Optimization over consecutive 1’s and circular 1’s constraints. Unpublished manuscript. Google Scholar
- Hoos, H. H., & Stützle, T. (2005). Stochastic local search: foundations and applications. San Francisco: Morgan Kaufmann. ISBN 1-55860-872-9. Google Scholar
- Jackson, W. K., Havens, W. S., & Dollard, H. (1997). Staff scheduling: a simple approach that worked (Technical report CMPT97-23). Intelligent Systems Lab, Centre for Systems Science, Simon Fraser University. Available at http://citeseer.nj.nec.com/101034.html.
- Johnson, D. S. (2002). A theoretician’s guide to the experimental analysis of algorithms. In M. H. Goldwasser, D. S. Johnson, & C. C. McGeoch (Eds.), Data structures, near neighbor searches, and methodology: fifth and sixth DIMACS implementation challenges (pp. 215–250). American Mathematical Society. URL http://www.research.att.com/~dsj/papers/experguide.ps.
- Krumke, S. O., Noltemeier, H., Schwarz, S., Wirth, H.-C., & Ravi, R. (1998). Flow improvement and network flows with fixed costs. In Proceedings of the international conference on operations research (OR-98), Zürich, Switzerland. Google Scholar
- Papadimitriou, C. H., & Steiglitz, K. (1982). Combinatorial optimization: algorithms and complexity. Englewood Cliffs: Prentice-Hall. Google Scholar
- Raz, R., & Safra, S. (1997). A sub constant error probability low degree test, and a sub constant error probability PCP characterization of NP. In Proceedings of the 29th ACM symposium on theory of computing, El Paso (TX), USA (pp. 475–484). Google Scholar