An Investigation of Heuristic Decomposition to Tackle Workforce Scheduling and Routing with Time-Dependent Activities Constraints.
Wasakorn LaesanklangDario Landa-SilvaJ. Arturo Castillo-SalazarPublished in: ICORES (Selected Papers) (2016)
Keyphrases
- constraint satisfaction
- resource constraints
- information technology
- activity recognition
- optimal solution
- routing problem
- iterative repair
- scheduling jobs
- precedence constraints
- scheduling algorithm
- shortest path
- resource allocation
- routing protocol
- solution quality
- travel time
- scheduling problem
- search algorithm
- constraint violations
- list scheduling
- information systems
- routing algorithm
- human resources
- simulated annealing
- job shop scheduling problem
- lower and upper bounds
- mixed integer program