Abstract
The problem of designing workforce shifts and break patterns is a relevant employee scheduling problem that arises in many contexts, especially in service industries. The issue is to find a minimum number of shifts, the number of workers assigned to them, and a suitable number of breaks so that the deviation from predetermined workforce requirements is minimized.
We tackle this problem by means of a hybrid strategy in the spirit of Large Neighborhood Search, which exploits a set of Local Search operators that resort to a Constraint Programming model for assigning breaks. We test this strategy on a set of random and real life instances employed in the literature.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)
Aykin, T.: Optimal shift scheduling with multiple break windows. Management Science 42(4), 591–602 (1996)
Aykin, T.: A comparative evaluation of modeling approaches to the labor shift scheduling problem. European J. of Operational Research 125, 381–397 (2000)
Bechtold, S.E., Jacobs, L.W.: Implicit modeling of flexible break assignments in optimal shift scheduling. Management Science 36(11), 1339–1351 (1990)
Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., Slany, W.: An AI-based break-scheduling system for supervisory personnel. IEEE Intelligent Systems 25(2), 60–73 (2010)
Côté, M.-C., Gendron, B., Quimper, C.-G., Rousseau, L.-M.: Formal languages for integer programming modeling of shift scheduling problems. Constraints (2009)
Dantzig, G.B.: A comment on eddie’s traffic delays at toll booths. Operations Research 2, 339–341 (1954)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 490(1-3), 61–95 (1991)
Di Gaspero, L., Gärtner, J., Kortsarz, G., Musliu, N., Schaerf, A., Slany, W.: The minimum shift design problem. Annals of Operations Research 155, 79–105 (2007)
Di Gaspero, L., Schaerf, A.: EASYLOCAL++: An object-oriented framework for flexible design of local search algorithms. Software — Practice & Experience 33(8), 733–765 (2003)
Hoos, H.H., Stützle, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann Publishers, San Francisco (2005)
Lourenço, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, G., Kochenberger, F. (eds.) Handbook of Metaheuristics, pp. 321–353. Kluwer Academic Publishers, Norwell (2002)
Musliu, N., Schaerf, A., Slany, W.: Local search for shift design. European J. of Operational Research 153(1), 51–64 (2004)
Musliu, N., Schafhauser, W., Widl, M.: A memetic algorithm for a break scheduling problem. In: Proceedings of the VIII Metaheuristic International Conference (MIC 2009), Hamburg, Germany, July 13-16 (2009)
Perron, L., Shaw, P., Furnon, V.: Propagation guided large neighborhood search. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 468–481. Springer, Heidelberg (2004)
Quimper, C.-G., Rousseau, L.-M.: A large neighbourhood search approach to the multi-activity shift scheduling problem. J. of Heuristics 16(3), 373–391 (2010)
Rekik, M., Cordeau, J.-F., Soumis, F.: Implicit shift scheduling with multiple breaks and work stretch duration restrictions. J. of Scheduling 13(1), 49–75 (2010)
Gecode Team. Gecode: Generic constraint development environment, http://www.gecode.org
Tellier, P., White, G.: Generating personnel schedules in an industrial setting using a tabu search algorithm. In: Burke, E.K., Rudová, H. (eds.) PATAT 2007. LNCS, vol. 3867, pp. 293–302. Springer, Heidelberg (2006)
Widl, M., Musliu, N.: An improved memetic algorithm for break scheduling. In: Proceedings of the 7th International Workshop on Hybrid Metaheuristics (HM 2010). LNCS, Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., Slany, W. (2010). A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2010. Lecture Notes in Computer Science, vol 6373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16054-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-16054-7_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16053-0
Online ISBN: 978-3-642-16054-7
eBook Packages: Computer ScienceComputer Science (R0)