Optimizing the Unlimited Shift Generation Problem

Good rosters have many benefits for an organization, such as lower costs, more effective utilization of resources and fairer workloads. This paper introduces the unlimited shift generation problem. The problem is to construct a set of shifts such that the staff demand at each timeslot is covered by a suitable number of employees. 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]  Kimmo Nurmi,et al.  A Framework for School Timetabling Problem , 2007 .

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

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

[4]  Edmund K. Burke,et al.  Practice and Theory of Automated Timetabling III , 2001, Lecture Notes in Computer Science.

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

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

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

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

[9]  Laurence A. Wolsey,et al.  Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007, Proceedings , 2007, CPAIOR.

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

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

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

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

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

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

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

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

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

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

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

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

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