Skip to main content
SpringerLink
Log in

The Personnel Task Scheduling Problem

  • Chapter
Optimization Methods and Applications

Part of the book series: Applied Optimization ((APOP,volume 52))

Abstract

In this paper we introduce a group of problems called Personnel Task Scheduling Problems (PTSP). A PTSP is concerned with assigning a set of tasks with fixed start and end time to a heterogeneous workforce. Each person in the workforce works a shift with given start and end times as well as having skills that qualify the person to perform a subset of all the tasks. This type of problem arises in rostering applications. There are several variations depending on the objective and the exact nature of the constraints. The aim of this paper is to describe this class of problems together with some basic properties, to survey previous work in this area, and to introduce some data sets that may serve as a test bed for future developments in this area.

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 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Arkin, M. and Silverberg, B. (1987). Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, Vol. 18, pp. 1–8.

    Article  MathSciNet  MATH  Google Scholar 

  • Bazaara, M. S. and Goode, J. J. (1979). A survey of various tactics for generating lagrangian multipliers in the context of lagrangian duality. European Journal of Operations Research, Vol. 3, pp. 322–338.

    Article  Google Scholar 

  • Beasley, J. E. (1993). Modern Heuristic Techniques for Combinatorial Problems, C.R.Reeves (Ed.). Oxford: Blackwell Scientific Publications.

    Google Scholar 

  • Carter, M. W. and Tovey, C. A. (1992). When is the classroom assignment problem hard? Operations Research, Vol. 40, pp. 28–39.

    Article  Google Scholar 

  • Dijkstra, M. C, Kroon, L. G., van Nunen, J. A. E. E. and Salomon, M. (1991). A DSS for capacity planning of aircraft maintenance personnel. International Journal of Production Economics, 23, 69–78.

    Article  Google Scholar 

  • Dondeti, V. R. and Emmons, H. (1992). Fixed job scheduling with two types of processors. Operations Research, Vol. 40, pp. 76–85.

    Article  MathSciNet  Google Scholar 

  • Dowling, D., Krishnamoorthy, M., Mackenzie, H. and Sier, D. (1997). Staff rostering at a large international airport. The Annals of Operations Research, Vol. 72, pp. 125–147.

    Article  MATH  Google Scholar 

  • Fischer, M. L. (1981). The Lagrangian relaxation method for solving integer programming problems. Management Science, Vol. 27, pp. 1–18.

    Article  MathSciNet  Google Scholar 

  • Fischer, M. L. (1985). An applications oriented guide to lagrangian relaxation. Interfaces, Vol. 15, pp. 10–21.

    Article  Google Scholar 

  • Fischetti, M., Martello, S. and Toth, P. (1987). The fixed job schedule problem with spread-time constraints. Operations Research, Vol. 35, pp. 849–858.

    Article  MathSciNet  MATH  Google Scholar 

  • Fischetti, M., Martello, S. and Toth, P. (1989). The fixed job schedule problem with working-time constraints. Operations Research, Vol. 37, pp. 395–403.

    Article  MathSciNet  MATH  Google Scholar 

  • Fischetti, M., Martello, S. and Toth, P. (1992). Approximation algorithms for fixed job schedule problems. Operations Research, Vol. 40, pp. 96–108.

    Article  MathSciNet  Google Scholar 

  • Ford, L. R. and Fulkerson, D. R. (1962). Flows in Networks. Princeton, New Jersey: Princeton University Press.

    Google Scholar 

  • Geoffrion, A. M. (1974). Lagrangian relaxation for integer programming. Mathematical Programming Studies, Vol. 2, pp. 82–114.

    Article  MathSciNet  Google Scholar 

  • Gertsbakh, I. and Stern, H. I. (1978). Minimal resources for fixed and variable job schedules. Operations Research, Vol. 26, pp. 68–85.

    Article  MathSciNet  MATH  Google Scholar 

  • Glassey, C. R. and Mizrach, M. (1986). A decision support system for assigning classs to rooms. Interfaces, Vol. 16, pp. 92–100.

    Article  Google Scholar 

  • Gondran, M. and Minoux, M. (1984). Graphs and Algorithms. A Wiley-Inter-science Publication. New York: John Wiley.

    Google Scholar 

  • Gupta, U. I., Lee, D. T. and Leung, Y. T. (1979). An optimal solution for the channel assignment problem. IEEE Transactions on Computing, C-28, 807–810.

    Article  MATH  Google Scholar 

  • Held, M., Wolfe, P. and Crowder, H. P. (1974). Validation of subgradient optimisation. Mathematical Programming, Vol. 6, pp. 62–88.

    Article  MathSciNet  MATH  Google Scholar 

  • Inc., C. O. (1994). Using the CPLEX callable library (version 3.0). CPLEX Optimization Inc., Suite 279, 930 Tahoe Blvd., Bldg 802, Incline Valley, NV 89451–9436,USA.

    Google Scholar 

  • Kolen, A. W. J. and Kroon, L. G. (1991). On the computational complexity of (maximum) class scheduling. European Journal of Operations Research, Vol. 54, pp. 23–38.

    Article  MATH  Google Scholar 

  • Kolen, A. W. J. and Kroon, L. G. (1992). License class design: complexity and algorithms. European Journal of Operations Research, Vol. 63, pp. 432–444.

    Article  MATH  Google Scholar 

  • Kolen, A. W. J. and Kroon, L. G. (1993). On the computational complexity of (maximum) shift class scheduling. European Journal of Operations Research, Vol. 64, pp. 138–151.

    Article  MATH  Google Scholar 

  • Kroon, L. G., Salomon, M. and Wassenhove, L. N. V. (1995). Exact and approximation algorithms for the operations fixed interval scheduling problem. European Journal of Operations Research, Vol. 82, pp. 190–205.

    Article  MATH  Google Scholar 

  • Kroon, L. G., Salomon, M. and Wassenhove, L. N. V. (1997). Exact and approximation algorithms for the tactical fixed interval scheduling problem. Operations Research, Vol. 45, pp. 624–638.

    Article  MathSciNet  MATH  Google Scholar 

  • Lipton, R. J. and Tomkins, A. (1994). Online interval scheduling. Pages 302 – 311 of: Proc 5th Annu ACM SIAM Symp Discrete Algorithms. ACM.

    Google Scholar 

  • Nakajima, K., Hakimi, S. L. and Lenstra, J. K. (1982). Complexity results for scheduling tasks in fixed intervals on two types of machines. SIAM Journal on Computing, Vol. 11, pp. 512–520.

    Article  MathSciNet  MATH  Google Scholar 

  • Seiden, S. S. (1998). Randomized online interval scheduling. OR Letters, Vol. 22, pp. 171–177.

    MathSciNet  MATH  Google Scholar 

  • Valls, V., Pérez, A. and Quintanilla, S. (1996). A graph colouring model for assigning a heterogenous workforce to a given schedule. European Journal of Operations Research, Vol. 90, pp. 285–302.

    Article  MATH  Google Scholar 

  • Woeginger, G. J. (1994). On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science, Vol. 130, pp. 5–16.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CSIRO Mathematical Information Sciences, Private Bag 10, Clayton South MDC, VIC, 3169, Australia

    Mohan Krishnamoorthy

Authors
  1. Mohan Krishnamoorthy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas T. Ernst
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics, Hong Kong Polytechnic University, Hong Kong, China

    Xiaoqi Yang  & Kok Lay Teo  & 

  2. School of Mathematics and Statistics, Curtin University of Technology, Australia

    Lou Caccetta

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Krishnamoorthy, M., Ernst, A.T. (2001). The Personnel Task Scheduling Problem. In: Yang, X., Teo, K.L., Caccetta, L. (eds) Optimization Methods and Applications. Applied Optimization, vol 52. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3333-4_20

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3333-4_20

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4850-2

  • Online ISBN: 978-1-4757-3333-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation