Solving the person-based multitask shift generation problem with breaks

Good rosters have many benefits for an organization, such as lower costs, more effective utilization of resources and fairer workloads. This paper introduces the person-based multitask shift generation problem with breaks. The problem is to construct a set of shifts such that the staff demand at each timeslot is covered as well as possible. A set of real-world instances derived from the actual problems solved for various companies is presented, along with our results. This research has contributed to better systems for our industry partners.

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

[2]  Gilles Pesant,et al.  A Cost-Regular Based Hybrid Column Generation Approach , 2006, Constraints.

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

[4]  P. Preux,et al.  Towards hybrid evolutionary algorithms , 1999 .

[5]  Graham Kendall,et al.  A Hyperheuristic Approach to Scheduling a Sales Summit , 2000, PATAT.

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

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

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

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

[10]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[11]  Nysret Musliu,et al.  Local search for shift design , 2004, Eur. J. Oper. Res..

[12]  Saeed Zolfaghari,et al.  Heuristics for Large Scale Labour Scheduling Problems in Retail Sector , 2007, INFOR Inf. Syst. Oper. Res..

[13]  Tommy Clausen,et al.  Airport Ground Staff Scheduling , 2010 .

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

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

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

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

[18]  Nicolas Chapados,et al.  Retail Store Workforce Scheduling by Expected Operating Income Maximization , 2011, CPAIOR.

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

[20]  Juraj Hromkovic,et al.  Models and algorithms for ground staff scheduling on airports , 2005 .

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

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

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