Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem

DOI10.1007/978-3-319-27680-9_12zbMath1367.90061OpenAlexW2310969197MaRDI QIDQ5281621

Dario Landa-Silva, Haneen Algethami, Wasakorn Laesanklang, Rodrigo Lankaites Pinheiro

Publication date: 26 July 2017

Published in: Operations Research and Enterprise Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-27680-9_12

zbMATH Keywords

mixed integer programminggenetic algorithmrouting problemworkforce schedulingproblem decomposition

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80) Theory of organizations, manpower planning in operations research (90B70)

Related Items (2)

Decomposition techniques with mixed integer programming and heuristics for home healthcare planning ⋮ An Investigation of Heuristic Decomposition to Tackle Workforce Scheduling and Routing with Time-Dependent Activities Constraints

This page was built for publication: Extended Decomposition for Mixed Integer Programming to Solve a Workforce Scheduling and Routing Problem