Models and Methods for Workforce Scheduling: An Application to Casino Operations

  • Christoph Staxk
  • Jürgen Zimmermann
  • Martin Morlock

Abstract

Labor costs become more and more important for a company’s success. This holds especially true for high-wage countries like Germany and for labor-intensive service industries like such as call centers or casinos. Efficient planning and allocation of personnel resources is therefore essential and quite a lot of models and methods for this so-called “workforce scheduling problem” have been developed thus far. Nevertheless, real problems are very different, complex, and specific. There exists no standard procedure to find optimal — or at least suboptimal — solutions (if the complexity of the problem is too great for exact algorithms). The formulation of the problem has to take into account the unique situation of a company and subsequently an appropriate solution method has to be adapted.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows. Prentice Hall, Englewood CliffsGoogle Scholar
  2. [2]
    Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Operations Research 46:316–329Google Scholar
  3. [3]
    Desrosiers J, Dumas Y, Solomon MM, Soumis F (1995) Time-constrained routing and scheduling. In: Ball MO, Magnanti TL, Monma CL, Nemhauser GL (eds.) Handbooks in OR & MS, Vol. 8, Elsevier, Amsterdam, pp. 35–139Google Scholar
  4. [4]
    Millar HH, Kiragu M (1998) Cyclic and non-cyclic scheduling of 12h shift nurses by network programming. European Journal of Operational Research 104:582–592CrossRefGoogle Scholar
  5. [5]
    Neumann K, Morlock M (2002) Operations Research. Hanser, MünchenGoogle Scholar
  6. [6]
    Stark C, Zimmermann J (2004) Scheduling regular and temporary employees with qualifications in a casino. In: Ahr D, Fahrion R, Oswald M, Reinelt G (eds.) Operations Research Proceedings 2003, Springer, Berlin, pp. 173–180Google Scholar
  7. [7]
    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, Springer, Berlin, pp. 207–212CrossRefGoogle Scholar
  8. [8]
    Yen JY (1971) Finding the k shortest loopless paths in a Network. Management Science 17:712–716CrossRefGoogle Scholar

Copyright information

© Deutscher Universitäts-Verlag/GWV Fachverlage GmbH, Wiesbaden 2006

Authors and Affiliations

  • Christoph Staxk
    • 1
  • Jürgen Zimmermann
    • 1
  • Martin Morlock
    • 2
  1. 1.Institut für WirtschaftswissenschaftTU ClausthalClausthal-Zellerfeld
  2. 2.Department of EconomicsUniversity of GießenGiefien

Personalised recommendations