Skip to main content
SpringerLink
Log in

An Exact Branch-and-Price Algorithm for Workforce Scheduling

  • Conference paper
Book cover Operations Research Proceedings 2004

Part of the book series: Operations Research Proceedings ((ORP,volume 2004))

Abstract

We consider a generic workforce scheduling problem, where employees are characterized by qualifications. Given a set of shifts for each day, we have to determine for each employee his working days as well as a specific shift for each working day. The overall objective is to find a set of feasible schedules with respect to hard and soft restrictions. We propose an integer multi-commodity network flow formulation for the problem under consideration and show how branch-and-price can be used to solve this problem.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barnhart, C, Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H. (1998) Branch-and-Price: Column Generation for Solving Huge Integer Programs. Operations Research 46, 316–329

    MathSciNet  Google Scholar 

  2. Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F. (1995) Time Constrained Routing and Scheduling. In: Ball, M.O., et al. Handbooks in OR & MS, Vol. 8., pp. 35–139, Elsevier, Amsterdam

    Google Scholar 

  3. Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D. (2004) Staff Scheduling and Rostering: A Review of Applications, Methods and Models. European Journal of Operational Research 153, 3–27

    Article  MathSciNet  Google Scholar 

  4. Millar, H.H., Kiragu, M. (1998) Cyclic and Non-Cyclic Scheduling of 12h Shift Nurses by Network Programming. European Journal of Operational Research 104, 582–592

    Article  Google Scholar 

  5. Yen, J.Y. (1971) Finding the k Shortest Loopless Paths in a Network. Management Science 17, 712–716

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department for Operations Research, Clausthal University of Technology, Julius-Albert-Str. 2, D-38678, Clausthal-Zellerfeld

    Christoph Stark & Jürgen Zimmermann

Authors
  1. Christoph Stark
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Zimmermann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Warandelaan 2, 5037 AB, Tilburg, The Netherlands

    Hein Fleuren , Dick den Hertog  & Peter Kort ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stark, C., Zimmermann, J. (2005). An Exact Branch-and-Price Algorithm for Workforce Scheduling. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_26

Download citation

Publish with us

Policies and ethics

Search

Navigation