Mixed Integer Programming with Decomposition for Workforce Scheduling and Routing with Time-dependent Activities Constraints.
Wasakorn LaesanklangDario Landa-SilvaJ. Arturo Castillo-SalazarPublished in: ICORES (2016)
Keyphrases
- mixed integer programming
- mixed integer
- valid inequalities
- production planning
- unit commitment
- column generation
- binary variables
- lot sizing
- dantzig wolfe decomposition
- scheduling problem
- linear program
- routing algorithm
- feasible solution
- convex hull
- resource allocation
- routing protocol
- evolutionary algorithm
- computationally expensive
- multistage
- shortest path
- linear programming
- dynamic programming