Skip to main content
Log in

Rostering in a rail passenger carrier

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

In this paper we present an applied study, commissioned by the regional rail passenger carrier EuskoTren, into how the annual workload of drivers can be allocated in an egalitarian fashion. The allocation must meet the constraints arising from working conditions and the preferences of employees, as reflected in collective bargaining agreements. The workload varies over the five periods, into which the year is divided, and according to the day of the week. Moreover, not all morning, evening and night shifts are of equal duration. Reduced services on public holidays are also considered. The solution to the problem proposed is obtained in four linked steps, at each of which a binary programming problem is solved using commercial software. Step one is to build five lists of weekly multi-shift patterns, two of them rotating, that contain all the shifts in the week. Step two consists of the partially rotating annual assignment of patterns to drivers, step three involves the extraction of shifts by reduction of services on public holidays, and step four incorporates the durations in hours into the shifts already assigned. The final solution obtained is quite satisfactory: all drivers are assigned a similar number of morning, evening and night shifts and Sundays off, and they work practically the same number of days and hours per year. The results obtained, the adaptability of the system to new requirements and the computation time used are fully satisfactory to the firm, which has decided to implement the model.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Azmat, C. S., Hürlimann, T., & Widmer, M. (2004). Mixed integer programming to schedule a single-shift workforce under annualized hours. Annals of Operations Research, 128, 199–215.

    Article  Google Scholar 

  • Beaumont, N. (1997). Using mixed integer programming to design employee rosters. Journal of the Operations Research Society, 48, 585–590.

    Google Scholar 

  • Burke, E. K., De Causmaecker, P., Vanden Berghe, G., & Van Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7, 441–499.

    Article  Google Scholar 

  • Caprara, A., Fischetti, M., Guida, P. L., Toth, P., & Vigo, D. (1997). Algorithms for railway crew management. Mathematical Programming, 79, 125–141.

    Google Scholar 

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

    Article  Google Scholar 

  • Caprara, A., Fischetti, M., Guida, P. L., Toth, P., & Vigo, D. (1999). Lecture notes in economics and mathematical systems : Vol. 471. Solution of large-scale railway crew planning problems: the Italian experience. Berlin: Springer.

    Google Scholar 

  • Ernst, A., Jiang, H., Krishnamoorthy, M., Nott, H., & Dier, D. (2000). Rail crew scheduling and rostering: optimisation algorithms. In Computer aided scheduling of public transport, 8th international conference, Berlin.

  • Ernst, A., Jiang, H., & Krishnamoorthy, M. (2004a). Staff scheduling and rostering: a review of applications, methods and models. European Journal of Operational Research, 153, 3–27.

    Article  Google Scholar 

  • Ernst, A., Jiang, H., Krishnamoorthy, M., Owens, B., & Sier, D. (2004b). An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research, 127, 21–144.

    Article  Google Scholar 

  • Esclapés, C. (2000). Asignación de conductores a jornadas de trabajo en empresas de transporte colectivo. PhD thesis, Universitat Politécnica de Catalunya, Spain.

  • Isken, M. W. (2004). An implicit tour scheduling model with applications in healthcare. Annals of Operations Research, 128, 91–109.

    Article  Google Scholar 

  • Laporte, G. (1999). The art and science of designing rotating schedules. Journal of the Operations Research Society, 50, 1011–1017.

    Google Scholar 

  • Laporte, G., & Pesant, G. (2004). A general multi-shift scheduling system. Journal of the Operations Research Society, 55, 1208–1217.

    Article  Google Scholar 

  • Lezaun, M., Pérez, G., & Sáinz de la Maza, E. (2006). Crew rostering problem in a public transport company. Journal of the Operations Research Society, 57, 1173–1179.

    Article  Google Scholar 

  • Lindo Systems Inc. (2003). Lingo User’s Guide, Chicago.

  • Muslija, N., Gärtmer, J., & Slany, W. (2002). Efficient generation of rotating workforce schedules. Discrete Applied Mathematics, 118, 85–98.

    Article  Google Scholar 

  • Tharmmaphornphilas, W., & Norman, B. A. (2004). A quantitative method for determining proper job rotation intervals. Annals of Operations Research, 128, 251–266.

    Article  Google Scholar 

  • Townsend, W. (1988). An approach to bus-crew roster design in London regional transport. Journal of the Operations Research Society, 6, 543–550.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mikel Lezaun.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lezaun, M., Pérez, G. & Sáinz de la Maza, E. Rostering in a rail passenger carrier. J Sched 10, 245–254 (2007). https://doi.org/10.1007/s10951-007-0024-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-007-0024-x

Keywords

Navigation