Skip to main content

Planning and Scheduling Staff Duties by Goal Programming

  • Conference paper
Multi-Objective Programming and Goal Programming

Part of the book series: Advances in Soft Computing ((AINSC,volume 21))

Abstract

We propose goal programming (GP) models for an integrated problem of staff duties planning and scheduling, for baggage services section staff at the Hong Kong International Airport. The problem is solved via its decomposition into a GP planner, followed by a GP scheduler. The results can be adopted as a good crew schedule in the sense that it is both feasible, satisfying various work conditions, and “optimal” in minimizing overtime shifts.

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

Access this chapter

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. Baker, K. (1976). Workforce allocation in cyclical scheduling problems: a survey. Operational Research Quarterly, Vol. 27, pp. 155–167

    Article  Google Scholar 

  2. Balakrishnan, N. Si Wong, R.T. (1990). A network model for the rotating workforce scheduling problem. Networks, Vol. 20, pp. 25–42

    Google Scholar 

  3. Ball, M., Bodin, L. Si Dial, R. (1983). A matching based heuristics for scheduling mass transit crews and vehicles. Transportation Science, Vol. 17, pp. 4–31

    Google Scholar 

  4. Bartholdi, J. Ratliff, H. (1978). Unnetworks, with applications to idle time scheduling. Management Science, Vol. 4, pp. 850–858

    Article  MathSciNet  Google Scholar 

  5. Bodin, L., Golden, B., Assad, A Ball, M. (1983). Routing and scheduling of vehicles and crews: the state of the art. Computer and Operations Research, Vol. 10, pp. 63–211

    MathSciNet  Google Scholar 

  6. Caprara, A., Fischetti, M. Toth, P. (1995). A heuristic method for the set covering problem. Technical Report, DEIS OR-95–8, University of Bologna.

    Google Scholar 

  7. Caprara, A., Toth, P., Vigo, D. Si Fischetti, M. (1998). Modeling and solving the crew rostering problem. Operations Research, Vol. 46, pp. 820–830

    Article  MATH  Google Scholar 

  8. Carpaneto, G. and Toth, P. (1987). Primal-dual algorithms for the assignment problem. Discrete Applied Mathematics, Vol. 18, pp. 137–153

    Article  MathSciNet  MATH  Google Scholar 

  9. Carraresi, P. Si Gallo, G. (1984). Network models for vehicle and crew scheduling. European Journal of Operational Research, Vol. 16, pp. 139–151

    Article  MathSciNet  MATH  Google Scholar 

  10. Chu, S.C.K. (2001). A goal programming model for crew duties generation. Journal of Multi-criteria Decision Analysis, Vol. 10, pp. 143–151

    Article  MATH  Google Scholar 

  11. Chu, S.C.K. Si Chan, E.C.H. (1998). Crew scheduling of light rail transit in Hong Kong: from modeling to implementation. Computers e4 Operations Research, Vol. 25, pp. 887–894

    MATH  Google Scholar 

  12. Desrochers, M., Gilbert, J., Sauve, M. Si Soumis, F. (1992). CREW-OPT: Subproblem modeling in a column generation approach to the urban transit crew scheduling problem. In M. Desrochers Si J.M. Rousseau (Eds.) Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386. Springer-Verlag, pp. 395–406

    Google Scholar 

  13. Desrochers, M. Soumis, F. (1989). A column generation approach to the urban transit crew scheduling problem. Transportation Science, Vol. 23, pp. 113

    Article  Google Scholar 

  14. Falkner, J.C. and Ryan, D.M. (1987). Aspects of bus crew scheduling using a set partitioning model. Computer-Aided Transit Scheduling: Proceedings of the Fourth Conference. Springer-Verlag, pp. 91–103

    Google Scholar 

  15. Falkner, J.C. Si Ryan, D.M. (1992). EXPRESS: Set partitioning for bus crew scheduling in Christchurch. In M. Desrochers Si J.M. Rousseau (Eds) Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386. Springer-Verlag, pp. 359–378

    Google Scholar 

  16. Gamache, M. Soumis, F. (1993). A method for optimally solving the rostering problem. Les Cahiers du GERAD, G-93–40. Montréal

    Google Scholar 

  17. Gamache, M., Soumis, F., Marquis, G. Desrosiers, J. (1994). A column generation approach for large scale aircrew rostering problems. Les Cahiers du GERAD, G-94–20. Montréal

    Google Scholar 

  18. Hagberg, B. (1985). An assignment approach to the rostering problem. In J.M. Rousseau (Ed.) Computer Scheduling of Public Transport 2. North-Holland

    Google Scholar 

  19. Lessard, R., Rousseau, J.M. Dupuis, D. (1981). HASTUS I: A mathematical programming approach to the bus driver scheduling problem. In A. Wren (Ed.) Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling. North-Holland, pp. 255–268

    Google Scholar 

  20. Mason, A.J., Ryan, D.M. Panton, D.M. (1998). Integrated simulation, heuristic and optimization approaches to staff scheduling. Operations Research, Vol. 46, pp. 161–175

    MATH  Google Scholar 

  21. Patrikalakis, I. Xerocostas, D. (1992). A new decomposition scheme of the urban public transit scheduling problem. In M. Desrochers J.M. Rousseau (Eds.) Computer-Aided Transit Scheduling, Lecture Notes in Economics and Mathematical Systems 386. Springer-Verlag, pp. 407–425

    Google Scholar 

  22. Ryan, D.M. Falkner, J.C. (1987). On the integer properties of scheduling set partitioning models. European Journal of Operational Research, Vol. 35, PP. 442–456

    Google Scholar 

  23. Ryan, D.M. Foster, B.A. (1981). An integer programming approach to scheduling. In A. Wren (Ed.) Computer Scheduling of Public Transport: Urban Passenger Vehicle and Crew Scheduling. North-Holland, pp. 269–280

    Google Scholar 

  24. Schrage, L. (1999). Optimization Modeling with LINGO,3/e. Lindo Systems Inc.

    Google Scholar 

  25. Segal, M. (1974). The operator-scheduling problem: a network flow approach. Operations Research, Vol. 22, 808–823

    Article  MATH  Google Scholar 

  26. Valouxis, C. Housos, E. (2002). Combined bus and driver scheduling. Computers Operations Research, Vol. 29, 243–259

    Article  MATH  Google Scholar 

  27. Vance, P.H., Barnhart, C., Johnson, E.L. Nemhauser, G.L. (1997). Airline crew scheduling: a new formulation and decomposition algorithm. Operations Research, Vol. 45, pp. 188–200

    MATH  Google Scholar 

  28. Wren, A., Smith, B.M. Miller, A.J. (1985). Complementary approaches to crew scheduling. In J.M. Rousseau (Ed.) Computer Scheduling of Public Transport 2. North-Holland, pp. 263–278

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chu, S.C.K., Yuen, C.S.Y. (2003). Planning and Scheduling Staff Duties by Goal Programming. In: Multi-Objective Programming and Goal Programming. Advances in Soft Computing, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36510-5_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-36510-5_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00653-4

  • Online ISBN: 978-3-540-36510-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics