Integrated Generation of Working Time Models and Staff Schedules in Workforce Management

Our project addresses the question how to automatically and simultaneously assign staff to workstations and generate optimised working time models on the basis of fluctuating personnel demand while taking into account practical constraints. Two fundamentally different solution approaches, a specialized constructive heuristic (commercial) and a hybrid metaheuristic (the evolution strategy) that integrates a repair heuristic to remove contraint violations are compared on a complex real-world problem from a retailer. The hybrid approach clearly outperforms the tailored constructive method. Taken together with our similar findings on a related staff scheduling problem from logistics this result suggests that the evolution strategy, despite its original focus on continuous parameter optimisation, is a powerful tool in combinatorial optimisation and deserves more attention. Moreover, hybridising a metaheuristic with a problem-specific repair heuristic seems a useful approach of resolving the conflict between domain-specific characteristics of a realworld problem and the desire to employ generic optimisation techniques, at least in the domain of workforce management.

[1]  Jordi Olivella,et al.  Selecting and adapting weekly work schedules with working time accounts: A case of a retail clothing chain , 2008, Eur. J. Oper. Res..

[2]  Andrew Lim,et al.  Nurse rostering problems - a bibliographic survey , 2003, Eur. J. Oper. Res..

[3]  Ignacio Castillo,et al.  Workforce scheduling with multiple objectives , 2009, Eur. J. Oper. Res..

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

[5]  Srimathy Mohan,et al.  Scheduling part-time personnel with availability restrictions and preferences to maximize employee satisfaction , 2008, Math. Comput. Model..

[6]  Günter Rudolph,et al.  An Evolutionary Algorithm for Integer Programming , 1994, PPSN.

[7]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[8]  Michael Pinedo,et al.  Planning and Scheduling in Manufacturing and Services , 2008 .

[9]  John W. Fowler,et al.  Heuristics for workforce planning with worker differences , 2008, Eur. J. Oper. Res..

[10]  Hans-Paul Schwefel,et al.  Evolution strategies – A comprehensive introduction , 2002, Natural Computing.

[11]  Donovan R. Hare Staff Scheduling with ILOG Solver , 1997 .

[12]  Hokey Min,et al.  The hybrid queuing and bi-objective integer programming model for scheduling frontline employees in a retail organisation , 2008, Int. J. Serv. Technol. Manag..

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

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

[15]  Lam Thu Bui,et al.  Success in Evolutionary Computation , 2008 .

[16]  Volker Nissen,et al.  Survivable Network Design with an Evolution Strategy , 2008 .

[17]  Reinhard Männer,et al.  Parallel Problem Solving from Nature — PPSN III , 1994, Lecture Notes in Computer Science.

[18]  Volker Nissen,et al.  Sub-daily Staff Scheduling for a Logistics Service Provider , 2010, KI - Künstliche Intelligenz.

[19]  David Lesaint,et al.  Field workforce scheduling , 2003 .

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

[21]  M. Sacramento Quintanilla,et al.  Skilled workforce scheduling in Service Centres , 2009, Eur. J. Oper. Res..

[22]  Maik rer. pol. Günther Hochflexibles Workforce Management , 2011 .

[23]  Özgür Kabak,et al.  Efficient shift scheduling in the retail sector through two-stage optimization , 2008, Eur. J. Oper. Res..