An Investigation of Heuristic Decomposition to Tackle Workforce Scheduling and Routing with Time-Dependent Activities Constraints
From MaRDI portal
Publication:2980180
DOI10.1007/978-3-319-53982-9_14zbMath1360.90127OpenAlexW2547761334MaRDI QIDQ2980180
J. Arturo Castillo-Salazar, Wasakorn Laesanklang, Dario Landa-Silva
Publication date: 28 April 2017
Published in: Operations Research and Enterprise Systems (Search for Journal in Brave)
Full work available at URL: http://eprints.nottingham.ac.uk/41537/
mixed integer programmingproblem decompositiontime-dependent activities constraintsworkforce scheduling and routing problem
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Cites Work
- Workforce scheduling and routing problems: literature survey and computational study
- Metaheuristics for solving a multimodal home-healthcare scheduling problem
- Scheduling technicians and tasks in a telecommunications company
- \textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem.
- Effective heuristic procedures for a field technician scheduling problem
- The home care crew scheduling problem: preference-based visit clustering and temporal dependencies
- An Investigation of Heuristic Decomposition to Tackle Workforce Scheduling and Routing with Time-Dependent Activities Constraints
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Decomposition Principle for Linear Programs
- Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem