Skip to main content
SpringerLink
Log in

One Problem, Two Structures, Six Solvers, and Ten Years of Personnel Scheduling

  • Conference paper
Principles and Practice of Constraint Programming (CP 2014)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 8656))

Abstract

The shift-scheduling problem was originally introduced by Edie in 1954 [8] in the context of scheduling highway toll booth operators. It was solved a short time later, by Georges Dantzig [6], using a set covering formulation. However, the Multi-Activity Shift Scheduling (MASSP) version of that problem, where one not only needs to schedule when employees are working or resting, but more precisely, what activity they are performing, still remains a challenge. During this invited lecture, we will recall the turning points of this 60-year journey, focusing particularly on the efforts of the last decade to solve MASSPs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 107–122. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Chapados, N., Joliveau, M., L‘Ecuyer, P., Rousseau, L.M.: Retail Store Scheduling for Profit. European Journal of Operations Research (2014), doi:10.1016/j.ejor.2014.05.033

    Google Scholar 

  3. Côté, M.C., Gendron, B., Quimper, C.G., Rousseau, L.M.: Formal languages for integer programming modeling of shift scheduling problems. Constraints 16(1), 54–76 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  4. Côté, M.C., Gendron, B., Rousseau, L.M.: Grammar-based integer programming models for multiactivity shift scheduling. Management Science 57(1), 151–163 (2011)

    Article  MATH  Google Scholar 

  5. Côté, M.C., Gendron, B., Rousseau, L.M.: Grammar-based column generation for personalized multi-activity shift scheduling. INFORMS Journal on Computing 25(3), 461–474 (2013)

    Article  MathSciNet  Google Scholar 

  6. Dantzig, G.: A comment on Edie’s traffic delay at toll booths. Journal of the Operations Research Society of America 2, 339–341 (1954)

    Article  MathSciNet  Google Scholar 

  7. Demassey, S., Pesant, G., Rousseau, L.M.: A cost-regular based hybrid column generation approach. Constraints 11(4), 315–333 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  8. Edie, L.: Traffic delays at toll booths. Journal of the Operations Research Society of America 2, 107–138 (1954)

    Article  Google Scholar 

  9. Fischetti, M., Liberti, L.: Orbital shrinking. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.T. (eds.) ISCO 2012. LNCS, vol. 7422, pp. 48–58. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Gange, G., Stuckey, P.J., Van Hentenryck, P.: Explaining Propagators for Edge-Valued Decision Diagrams. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 340–355. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  11. Kadioglu, S., Sellmann, M.: Grammar constraints. Constraints 15(1), 117–144 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  12. Pelleau, M., Rousseau, L.-M., L’Ecuyer, P., Zegal, W., Delorme, L.: Scheduling of Agents from Forecasted Future Call Arrivals at Hydro-Québec’ s Call Centers. In: Principles and Practice of Constraint Programming, CP 2013, Springer, Heidelberg (2014)

    Google Scholar 

  13. Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482–495. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Quimper, C.G., Rousseau, L.M.: A large neighbourhood search approach to the multi-activity shift scheduling problem. Journal of Heuristics 16(3), 373–392 (2010)

    Article  MATH  Google Scholar 

  15. Quimper, C.G., Walsh, T.: Global grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 751–755. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Quimper, C.G., Walsh, T.: Decomposing global grammar constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 590–604. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  17. Salvagnin, D., Walsh, T.: A hybrid MIP/CP approach for multi-activity shift scheduling. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 633–646. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  18. Sellmann, M.: The theory of grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 530–544. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIRRELT, École Polytechnique de Montréal, C.P. 6128, succ. Centre-ville, Montréal, H3C 3J7, Canada

    Louis-Martin Rousseau

Authors
  1. Louis-Martin Rousseau
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Insight Centre for Data Analytics, School of Computer Science and IT, University College Cork, Western Road, Cork, Ireland

    Barry O’Sullivan

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Rousseau, LM. (2014). One Problem, Two Structures, Six Solvers, and Ten Years of Personnel Scheduling. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10428-7_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10427-0

  • Online ISBN: 978-3-319-10428-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation