Abstract
The min-SHIFT DESIGN problem 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 the workforce requirements.
Our research considers both theoretical and practical aspects of the min-SHIFT DESIGN problem. First, we establish a complexity result by means of a reduction to a network flow problem. The result shows that even a logarithmic approximation of the problem is NP-hard. However, the problem becomes polynomial if the issue of minimizing the number of shifts is neglected. On the basis of these results, we propose a hybrid heuristic for the problem which relies on a greedy construction phase, based on the network flow analogy, followed by a local search algorithm that makes use of multiple neighborhood relations.
An experimental analysis on structured random instances shows that the hybrid heuristic clearly outperforms an existing commercial implementation and highlights the respective merits of the composing heuristics for different performance parameters.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Balakrishnan and R.T. Wong. A network model for the rotating workforce scheduling problem. Networks, 20:25–42, 1990.
J. Bartholdi, J. Orlin, and H. Ratliff. Cyclic scheduling via integer programs with circular ones. Operations Research, 28:110–118, 1980.
M. R. Garey and D. S. Johnson. Computers and Intractability-A guide to NP-completeness. W.H. Freeman and Company, San Francisco, 1979.
L. Di Gaspero, J. Gärtner, G. Kortsarz, N. Musliu, A. Schaerf, and W. Slany. The minimum shift design problem: theory and practice. In Giuseppe Di Battista and Uri Zwick, editors, Proc. of the 11th Annual European Symposium on Algorithms (ESA 2003), number 2832 in Lecture Notes in Computer Science, pages 593–604. Springer-Verlag, Berlin-Heidelberg, 2003. ISBN 3-540-20064-9.
L. Di Gaspero and A. Schaerf. Multi-neighbourhood local search with application to course timetabling. In E. Burke and P. De Causmaecker, editors, Lecture Notes in Computer Science, number 2740 in Lecture Notes in Computer Science, pages 263–278. Springer-Verlag, Berlin-Heidelberg, 2003. ISBN 3-540-40699-9.
L. Di Gaspero and A. Schaerf. EASYLOCAL++: An object-oriented framework for fexible design of local search algorithms. Software Practice & Experience, 33(8):733–765, July 2003.
F. Glover and M. Laguna. Tabu search. Kluwer Academic Publishers, Boston, July 1997. ISBN 0-7923-9965-X.
F. Glover and C. McMillan. The general employee scheduling problem: An integration of MS and AI. Computers & Operations Research, 13(5):563–573, 1986.
A.V. Goldberg. An efficient implementation of a scaling minimum-cost fbw algorithm. Journal of Algorithms, 22:1–29, 1997.
W.K. Jackson, W.S. Havens, and H. Dollard. Staff scheduling: A simple approach that worked. Technical Report CMPT97-23, Intelligent Systems Lab, Centre for Systems Science, Simon Fraser University, 1997. Available at http://citeseer.nj.nec.com/101034.html.
D.S. Johnson. A theoretician’s guide to the experimental analysis of algorithms. In Proc. 5th and 6th DIMACS Implementation Challenges. American Mathematical Society, 2002. URL http://www.research.att.com/~dsj/papers/experguide.ps.
G. Laporte. The art and science of designing rotating schedules. Journal of the Operational Research Society, 50:1011–1017, 1999.
H.C. Lau. On the complexity of manpower scheduling. Computers & Operations Research, 23(1):93–102, 1996.
N. Musliu, J. Gärtner, and W. Slany. Efficient generation of rotating workforce schedules. Discrete Applied Mathematics, 118(1–2):85–98, 2002.
N. Musliu, A. Schaerf, and W. Slany. Local search for shift design. European Journal of Operational Research, 153(1):51–64, 2004.
C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, 1982.
G. Thompson. A simulated-annealing heuristic for shift scheduling using non-continuously available employees. Computers & Operations Research, 23(3):275–278, 1996.
J.M. Tien and A. Kamiyama. On manpower scheduling algorithms. SIAM Review, 24(3):275–287, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer Science+Business Media, Inc.
About this chapter
Cite this chapter
Di Gasperol, L., Gärtner, J., Kortsarz, G., Musliu, N., Schaerf, A., Slany, W. (2005). Theory and Practice of the Minimum Shift Design Problem. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds) Metaheuristics: Progress as Real Problem Solvers. Operations Research/Computer Science Interfaces Series, vol 32. Springer, Boston, MA. https://doi.org/10.1007/0-387-25383-1_7
Download citation
DOI: https://doi.org/10.1007/0-387-25383-1_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-25382-4
Online ISBN: 978-0-387-25383-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)