Solving the shift and break design problem using integer linear programming

In this paper we propose a two-phase approach to solve the shift and break design problem using integer linear programming. In the first phase we create the shifts, while heuristically taking the breaks into account. In the second phase we assign breaks to each occurrence of any shift, one by one, repeating this until no improvement is found. On a set of benchmark instances, composed by both randomly-generated and real-life ones, this approach obtains better results than the current best known method for shift and break design problem.

[1]  Nysret Musliu,et al.  Modeling and solving a real-life multi-skill shift design problem , 2017, Ann. Oper. Res..

[2]  T. Aykin.  Optimal Shift Scheduling with Multiple Break Windows , 1996 .

[3]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

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

[5]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[6]  James B. Orlin,et al.  Cyclic Scheduling via Integer Programs with Circular Ones , 1980, Oper. Res..

[7]  Leslie C. Edie,et al.  Traffic Delays at Toll Booths , 1954, Oper. Res..

[8]  Krzysztof R. Apt,et al.  Principles of constraint programming , 2003 .

[9]  Pablo Moscato,et al.  On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms , 1989 .

[10]  Werner Schafhauser,et al.  A Memetic Algorithm for a Break Scheduling Problem , 2009 .

[11]  Jean-François Cordeau,et al.  Implicit shift scheduling with multiple breaks and work stretch duration restrictions , 2005, J. Sched..

[12]  Erik Demeulemeester,et al.  Personnel scheduling: A literature review , 2013, Eur. J. Oper. Res..

[13]  Nysret Musliu,et al.  An AI-Based Break-Scheduling System for Supervisory Personnel , 2010, IEEE Intelligent Systems.

[14]  Nysret Musliu,et al.  A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem , 2010, Hybrid Metaheuristics.

[15]  Manuel Laguna,et al.  Tabu Search , 1997 .

[16]  Dorit S. Hochbaum,et al.  Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms , 2006, Discret. Optim..

[17]  Nysret Musliu,et al.  The break scheduling problem: complexity results and practical algorithms , 2014, Memetic Computing.

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

[19]  Rina Dechter,et al.  Temporal Constraint Networks , 1989, Artif. Intell..

[20]  Arthur F. Veinott,et al.  Optimal Capacity Scheduling---II , 1962 .

[21]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

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

[23]  Miroslaw Truszczynski,et al.  Answer set programming at a glance , 2011, Commun. ACM.

[24]  Nysret Musliu,et al.  An Improved Memetic Algorithm for Break Scheduling , 2010, Hybrid Metaheuristics.

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

[26]  Stephen E. Bechtold,et al.  Implicit modeling of flexible break assignments in optimal shift scheduling , 1990 .