The multi-visit team orienteering problem with precedence constraints.
Saïd HanafiRenata MansiniRoberto ZanottiPublished in: Eur. J. Oper. Res. (2020)
Keyphrases
- precedence constraints
- scheduling problem
- branch and bound algorithm
- parallel machines
- precedence relations
- vertex cover
- release dates
- approximation algorithms
- parallel processors
- unit length
- series parallel
- single machine scheduling problem
- sequence dependent setup times
- setup times
- partially ordered
- global constraints
- partial order
- maximum lateness
- data structure
- heuristic search
- computer systems
- partially ordered sets