Heuristic Algorithms for Solving Uncertain Routing-Scheduling Problem.
Jerzy JózefczykMichal MarkowskiPublished in: ICAISC (2008)
Keyphrases
- scheduling problem
- single machine
- flowshop
- np hard
- minimizing makespan
- strongly np hard
- precedence constraints
- processing times
- routing algorithm
- tabu search
- network topology
- routing problem
- setup times
- routing protocol
- permutation flowshop
- total tardiness
- combinatorial optimization
- parallel machines
- shortest path
- decision making