Paper Info
Title
Mixed Integer Programming with Decomposition for Workforce Scheduling and Routing with Time-dependent Activities Constraints.
Abstract
We present a mixed integer programming decomposition approach to tackle workforce scheduling and routing problems (WSRP) that involve time-dependent activities constraints. The proposed method is called repeated decomposition with conflict repair (RDCR) and it consists of repeatedly applying a phase of problem decomposition and sub-problem solving, followed by a phase dedicated to conflict repair. Five types of time dependent activities constraints are considered: overlapping, synchronisation, minimum difference, maximum difference, and minimum-maximum difference. Experiments are conducted to compare the proposed method to a tailored greedy heuristic. Results show that the proposed RDCR is an effective approach to harness the power of mixed integer programming solvers to tackle the difficult and highly constrained WSRP in practical computational time.
Year
Venue
Field
2016
ICORES
Workforce scheduling,Synchronization,Mathematical optimization,Computer science,Greedy algorithm,Integer programming,Operations management
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
6
3
Name
Order
Citations
PageRank
Wasakorn Laesanklang152.19
Dario Landa Silva231628.38
J. Arturo Castillo-Salazar3242.81