A parallel matheuristic for the technician routing and scheduling problem.
Victor PillacChristelle GuéretAndrés L. MedagliaPublished in: Optim. Lett. (2013)
Keyphrases
- scheduling problem
- parallel machines
- single machine
- flowshop
- identical machines
- tabu search
- np hard
- ad hoc networks
- network topology
- earliness tardiness
- processing times
- routing algorithm
- parallel processing
- maximum lateness
- inter domain
- parallel implementation
- parallel computing
- mobile ad hoc networks
- computer architecture
- parallel programming
- total tardiness
- lower bound