Branch-and-Price for Personalized Multiactivity Tour Scheduling

This paper presents a branch-and-price approach to solve personalized tour-scheduling problems in a multiactivity context. Two formulations are considered. In the first, columns correspond to daily shifts that are modeled with context-free grammars, and tours are assembled in the master problem by means of extra constraints. In the second formulation, columns correspond to tours that are built in a two-phase procedure. The first phase involves the composition of daily shifts; the second assembles those shifts to generate tours using a shortest path problem with resource constraints. Both formulations are flexible enough to allow different start times, lengths, and days-off patterns, as well as multiple breaks and continuity and discontinuity in labor requirements. We present computational experiments on problems dealing with up to five work activities and a one-week planning horizon. The results show that the second formulation is stronger in terms of its lower bound and that it is able to find high-quality solutions for all instances with an optimality gap lower than 1%.

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

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

[3]  Christian Bessière.  Principles and Practice of Constraint Programming - CP 2007, 13th International Conference, CP 2007, Providence, RI, USA, September 23-27, 2007, Proceedings , 2007, CP.

[4]  Oktay Günlük,et al.  An integer programming model for the weekly tour scheduling problem , 2001 .

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

[6]  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.

[7]  Louis-Martin Rousseau,et al.  Grammar-Based Integer Programming Models for Multiactivity Shift Scheduling , 2009, Manag. Sci..

[8]  Arthur M. Geoffrion,et al.  Lagrangian Relaxation for Integer Programming , 2010, 50 Years of Integer Programming.

[9]  Jonathan F. Bard,et al.  Solving large-scale tour scheduling problems , 1994 .

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

[11]  Michael J. Brusco,et al.  An integrated approach to shift-starting time selection and tour-schedule construction , 2011, J. Oper. Res. Soc..

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

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

[14]  Guy Desaulniers,et al.  A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts , 2013, J. Sched..

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

[16]  Jonathan F. Bard,et al.  Flexible weekly tour scheduling for postal service workers using a branch and price , 2013, J. Sched..

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

[18]  Louis-Martin Rousseau,et al.  A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem , 2014, J. Sched..

[19]  Raik Stolletz,et al.  Stabilized branch and price with dynamic parameter updating for discontinuous tour scheduling , 2014, Comput. Oper. Res..

[20]  Larry W. Jacobs,et al.  Overlapping start-time bands in implicit tour scheduling , 1996 .

[21]  Laurent Péridy,et al.  Cut generation for an employee timetabling problem , 2009, Eur. J. Oper. Res..

[22]  Serdar Kadioglu,et al.  Grammar constraints , 2009, Constraints.

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

[24]  Louis-Martin Rousseau,et al.  Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling , 2013, INFORMS J. Comput..

[25]  Guy Desaulniers,et al.  Assigning multiple activities to work shifts , 2009, J. Sched..

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

[27]  Andrés L. Medaglia,et al.  Constrained network-based column generation for the multi-activity shift scheduling problem ☆ , 2012 .

[28]  Gilles Pesant,et al.  The Polytope of Context-Free Grammar Constraints , 2009, CPAIOR.

[29]  Louis-Martin Rousseau,et al.  A large neighbourhood search approach to the  multi-activity shift scheduling problem , 2010, J. Heuristics.

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

[31]  Kenneth R. Baker,et al.  Workforce Allocation in Cyclical Scheduling Problems: A Survey , 1976 .

[32]  James E. Bailey,et al.  Integrated days off and shift personnel scheduling , 1985 .

[33]  Hanif D. Sherali,et al.  A column generation approach for an employee scheduling problem with multiple shifts and work locations , 2008, J. Oper. Res. Soc..

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

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

[36]  Monia Rekik,et al.  Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic , 2015, J. Sched..

[37]  Larry W. Jacobs,et al.  Optimal Models for Meal-Break and Start-Time Flexibility in Continuous Tour Scheduling , 2000 .

[38]  Hernán G. Abeledo,et al.  A branch-and-price approach for large-scale employee tour scheduling problems , 2007, Ann. Oper. Res..

[39]  Michael J. Showalter,et al.  Simple Approaches to Shift, Days-Off and Tour Scheduling Problems , 1983 .

[40]  Louis-Martin Rousseau,et al.  Formal languages for integer programming modeling of shift scheduling problems , 2009, Constraints.

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