Skip to main content

Fair Cyclic Roster Planning—A Case Study for a Large European Airport

  • Conference paper
  • First Online:
Operations Research Proceedings 2014

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

Abstract

Airport ground staff scheduling has been long known as one of the most challenging and successful application of operations research. In this presentation, we will concentrate on one type of rostering known as cyclic roster. Numerous aspects required in practice have to be taken into account, amongst others crew qualification, work locations and the travel time between each location, government regulations and labor agreements, etc. INFORM’s branch-and-price solution approach covers all of these aspects and is in use on many airports world-wide. Cyclic Rosters cover several fairness aspects by construction. In this case study we will discuss why one of our customers wanted to add additional fairness criteria to the roster. We show which new fairness requirements are needed. We present a fast local search post-processing step that transforms a cost optimal shift plan into a fair cyclic shift plan with the same costs. The transformed plans are highly accepted and are in operational use.

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 EPUB and 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

Notes

  1. 1.

    We only denote the normal cases here and omit the technical cases where a formula must take into account the wrap-around from the last week in the plan to the first one.

  2. 2.

    One scenario had only 1 function, all other had more. 19 scenarios had between 54 and 252 persons, only 1 had 9 persons, the largest scenarios contained 684, 789 persons, resp.

  3. 3.

    The roster is a 6-3 roster. It contains \(189\cdot 7 = 1323\) days and \(189\cdot 7/(6+3) = 147\) work stretches. In a 6-3 pattern, \(147\cdot 6=882\) shift/functions combinations have to be assigned.

References

  1. Bennett, B.T., Potts, R.B.: Rotating roster for a transit system. Trans. Sci. 2, 14–34 (1968)

    Article  Google Scholar 

  2. Çezik, T., Günük, O., Luss, H.: An integer programming model for the weekly tour scheduling problem. Nav. Res. Logist. 48, 607–624 (2001)

    Article  Google Scholar 

  3. Chew, K.L.: Cyclic schedule for apron services. J. Oper. Res. Soc. 42, 1061–1069 (1991)

    Article  Google Scholar 

  4. Ernst, A.T., Jiang, H., Krishnamoorthy, M., Sier, D.: Staff scheduling and rostering: a review of applications, methods and models. EJOR 153, 3–27 (2004)

    Article  Google Scholar 

  5. Herbers, J.: Models and algorithms for ground staff scheduling on airports. Dissertation, RWTH Aachen (2005)

    Google Scholar 

  6. Khoong, C.M., Lau, H.C., Chew, L.W.: Automated manpower rostering: techniques and experience. Int. Trans. Oper. Res. 1, 353–361 (1994)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Torsten Fahle .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Fahle, T., Vermöhlen, W. (2016). Fair Cyclic Roster Planning—A Case Study for a Large European Airport. In: Lübbecke, M., Koster, A., Letmathe, P., Madlener, R., Peis, B., Walther, G. (eds) Operations Research Proceedings 2014. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-28697-6_19

Download citation

Publish with us

Policies and ethics