Variable neighborhood search-based subproblem solution procedures for a parallel shifting bottleneck heuristic for complex job shops.
Andrew BilykLars MönchPublished in: CASE (2012)
Keyphrases
- variable neighborhood search
- single machine scheduling problem
- tabu search
- metaheuristic
- traveling salesman problem
- heuristic methods
- neighborhood search
- benchmark instances
- minimum spanning tree
- dynamic programming
- search procedure
- optimal solution
- hybrid method
- vehicle routing problem
- solution quality
- precedence constraints
- hybrid algorithm
- search space
- objective function