A large neighbourhood search approach to the  multi-activity shift scheduling problem

The challenge in shift scheduling lies in the construction of a set of work shifts, which are subject to specific regulations, in order to cover fluctuating staff demands. This problem becomes harder when multi-skill employees can perform many different activities during the same shift. In this paper, we show how formal languages (such as regular and context-free languages) can be enhanced and used to model the complex regulations of the shift construction problem. From these languages we can derive specialized graph structures that can be searched efficiently. The overall shift scheduling problem can then be solved using a Large Neighbourhood Search. These approaches are able to return near optimal solution on traditional single activity problems and they scale well on large instances containing up to 10 activities.

[1]  Louis-Martin Rousseau,et al.  Modeling the Regular Constraint with Integer Programming , 2007, CPAIOR.

[2]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[3]  Meinolf Sellmann.  The Theory of Grammar Constraints , 2006, CP.

[4]  Jean-François Cordeau,et al.  Using Benders Decomposition to Implicitly Model Tour Scheduling , 2002, Ann. Oper. Res..

[5]  Toby Walsh,et al.  Global Grammar Constraints , 2006, CP.

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

[7]  James B. Orlin,et al.  Very Large-Scale Neighborhood Search Techniques in Timetabling Problems , 2006, PATAT.

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

[9]  Abraham P. Punnen,et al.  A survey of very large-scale neighborhood search techniques , 2002, Discret. Appl. Math..

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

[11]  Michel Gendreau,et al.  Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows , 2002, J. Heuristics.

[12]  Gary M. Thompson.  Improved implicit optimal modeling of the labor shift scheduling problem , 1995 .

[13]  Toby Walsh,et al.  Decomposing Global Grammar Constraints , 2007, CP.

[14]  Andreas T. Ernst,et al.  An Annotated Bibliography of Personnel Scheduling and Rostering , 2004, Ann. Oper. Res..

[15]  Larry P. Ritzman,et al.  The Disaggregation of Aggregate Manpower Plans , 1976 .

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

[17]  James B. Orlin,et al.  Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems , 2005, IPCO.

[18]  T Aykin.  A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows , 1998, J. Oper. Res. Soc..

[19]  Tadao Kasami,et al.  An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages , 1965 .

[20]  Gilles Pesant,et al.  A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

[21]  Fred W. Glover,et al.  The general employee scheduling problem. An integration of MS and AI , 1986, Comput. Oper. Res..

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

[23]  Michael A. Trick,et al.  Optimal shift scheduling: A branch-and-price approach , 2000 .

[24]  Nashat Mansour,et al.  A distributed genetic algorithm for deterministic and stochastic labor scheduling problems , 1999, Eur. J. Oper. Res..

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

[26]  Larry W. Jacobs,et al.  A Simulated Annealing Approach to the Solution of Flexible Labour Scheduling Problems , 1993 .

[27]  Paul Shaw,et al.  Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems , 1998, CP.

[28]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

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

[30]  Jeffrey D. Ullman,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001, SIGA.

[31]  Stephen E. Bechtold,et al.  The equivalence of general set‐covering and implicit integer programming formulations for shift scheduling , 1996 .

[32]  F. Robert Jacobs,et al.  Tour Scheduling and Task Assignment of a Heterogeneous Work Force: A Heuristic Approach , 1991 .

[33]  John Cocke,et al.  Programming languages and their compilers: Preliminary notes , 1969 .

[34]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..