Optimized Workforce Scheduling in Bus Transit Companies

Workforce scheduling has become increasingly important for both the public sector and private companies. Optimized shifts and rosters lower costs, utilize resources more effectively and ensure fairer workloads and distribution of shifts. This paper presents our work with workforce scheduling in bus transit companies. We present the workforce scheduling process in these companies and give an example of an optimized real-world staff rostering instance. We also give an outline of the PEAST algorithm which we use to tackle workforce scheduling problems. The algorithm has been successfully used to solve workforce scheduling problems in Finnish bus transit companies. The algorithm has been integrated into market-leading workforce management software in Finland.

[1]  Andreas T. Ernst,et al.  Staff scheduling and rostering: A review of applications, methods and models , 2004, Eur. J. Oper. Res..

[2]  Kimmo Nurmi,et al.  Solving the person-based multitask shift generation problem with breaks , 2013, 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO).

[3]  Dániel Marx,et al.  RAPH COLORING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING , 2022 .

[4]  Kimmo Nurmi,et al.  Days-off scheduling for a bus transportation company , 2011 .

[5]  Guy Desaulniers,et al.  Chapter 2 Public Transit , 2007, Transportation.

[6]  Kimmo Nurmi,et al.  Solving real-world workforce scheduling problems , 2013 .

[7]  Alan A. Bertossi,et al.  On some matching problems arising in vehicle scheduling models , 1987, Networks.

[8]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[9]  Hoong Chuin Lau,et al.  On the complexity of manpower shift scheduling , 1996, Comput. Oper. Res..

[10]  Hesham K. Alfares,et al.  Survey, Categorization, and Comparison of Recent Tour Scheduling Literature , 2004, Ann. Oper. Res..

[11]  Amnon Meisels,et al.  Modelling and Solving Employee Timetabling Problems , 2003, Annals of Mathematics and Artificial Intelligence.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Natalia Kliewer,et al.  An overview on vehicle scheduling models , 2009, Public Transp..

[14]  Jingpeng Li,et al.  A Self-Adjusting Algorithm for Driver Scheduling , 2005, J. Heuristics.

[15]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[16]  Guy Kortsarz,et al.  The minimum shift design problem , 2007, Ann. Oper. Res..

[17]  K. Nurmi,et al.  Optimizing Large-Scale Staff Rostering Instances , 2012 .

[18]  K. Nurmi,et al.  Using the PEAST Algorithm to Roster Nurses in an Intensive-Care Unit in a Finnish Hospital , 2012 .

[19]  James M. Tien,et al.  On Manpower Scheduling Algorithms , 1982 .

[20]  Ann S. K. Kwan,et al.  A Flexible System for Scheduling Drivers , 2003, J. Sched..

[21]  Kimmo Nurmi,et al.  Crucial Components of the PEAST Algorithm in Solving Real-World Scheduling Problems , 2013 .