Skip to main content

Workload Balancing in Transportation Crew Rostering

  • Conference paper
  • First Online:
Operations Research Proceedings 2013

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

  • 1574 Accesses

Abstract

In crew rostering, balanced workload allocation is a critical issue and an important planning phenomenon that affects both the quality of crew schedules and personnel satisfaction. We focus on workload balancing in transportation systems where deadheading of crew is possible. A network flow formulation of the problem is developed, and an optimal solution method is proposed. We compare the computational performance of the optimal solution method with the solution of the problem with a commercial solver only. We present the results of our computational experiments with well-known problem instances from the crew scheduling literature.

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

References

  1. Beasley, J. E., & Cao, B. (1996). A tree search algorithm for the crew scheduling problem. European Journal of Operational Research, 94, 517–526.

    Article  Google Scholar 

  2. Bellanti, F., Carello, G., & Tadei, R. (2004). A greedy-based neighborhood search approach to a nurse rostering problem. European Journal of Operational Research, 153, 28–40.

    Article  Google Scholar 

  3. Burke, E., Cowling, P., Causmaecker, P. D., & Berghe, G. V. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15, 199–214.

    Article  Google Scholar 

  4. Cappanera, P., & Scutellá, M. (2011). Color-coding algorithms to the balanced path problem: computational issues. INFORMS Journal on Computing, 23, 446–459.

    Article  Google Scholar 

  5. Şahin, G., & Yüceoğlu, B. (2011). Tactical crew planning in railways. Transportation Research Part E: Logistics and Transportation Review, 47, 1221–1243.

    Article  Google Scholar 

Download references

Acknowledgments

This research has been supported by The Scientific and Technological Research Council of Turkey (TÜBİTAK) under Grant 110M495.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Güvenç Şahin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Şahin, G., Dashty Saridarq, F. (2014). Workload Balancing in Transportation Crew Rostering. In: Huisman, D., Louwerse, I., Wagelmans, A. (eds) Operations Research Proceedings 2013. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-07001-8_52

Download citation

Publish with us

Policies and ethics