Solving technician routing and scheduling problem using improved particle swarm optimization.
Engin PekelPublished in: Soft Comput. (2020)
Keyphrases
- scheduling problem
- improved particle swarm optimization
- tabu search
- flowshop
- single machine
- np hard
- setup times
- parallel machines
- strongly np hard
- processing times
- minimizing makespan
- combinatorial optimization
- ad hoc networks
- search algorithm for solving
- shortest path
- network topology
- sequence dependent setup times
- permutation flowshop