Workforce Scheduling Using the PEAST Algorithm

Workforce scheduling has become increasingly important for both the public sector and private companies. Good rosters have many benefits for an organization, such as lower costs, more effective utilization of resources and fairer workloads and distribution of shifts. This paper presents a framework and an algorithm that have been successfully used to model and solve workforce scheduling problems in Finnish companies. The algorithm has been integrated into market-leading workforce management software in Finland.

[1]  Dries R. Goossens,et al.  Optimizing the Unlimited Shift Generation Problem , 2012, EvoApplications.

[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]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[4]  K. Nurmi,et al.  The Workforce Scheduling Process Using the PEAST Algorithm , 2013 .

[5]  Oscar Castillo,et al.  IAENG Transactions on Engineering Technologies , 2013 .

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

[7]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[8]  Fred Glover.  New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems , 1992, Computer Science and Operations Research.

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

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

[11]  Kimmo Nurmi,et al.  A Framework for School Timetabling Problem , 2007 .

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

[13]  Kimmo Nurmi,et al.  Scheduling the finnish major ice hockey league , 2009, 2009 IEEE Symposium on Computational Intelligence in Scheduling.

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

[15]  Jari Kyngäs.  Solving Challenging Real-World Scheduling Problems , 2011 .

[16]  George B. Dantzig,et al.  Letter to the Editor - A Comment on Edie's "Traffic Delays at Toll Booths" , 1954, Oper. Res..

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

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

[19]  Patrick De Causmaecker,et al.  Towards a reference model for timetabling and rostering , 2012, Ann. Oper. Res..

[20]  H. C. Lau.  On the complexity of manpower shift scheduling , 1996 .

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

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

[23]  Steven Walczak,et al.  Nurse Scheduling: From Academia to Implementation or Not? , 2007, Interfaces.