Exponential neighborhood search for a parallel machine scheduling problem.
Yasmín Á. Ríos-SolísFrancis SourdPublished in: Comput. Oper. Res. (2008)
Keyphrases
- neighborhood search
- parallel machine scheduling problem
- scheduling problem
- simulated annealing
- release dates
- variable neighborhood search
- traveling salesman problem
- parallel machines
- single machine scheduling problem
- single machine
- path relinking
- tabu search
- vehicle routing problem
- heuristic methods
- processing times
- graph search
- np hard
- precedence constraints
- special case
- convex hull
- combinatorial optimization
- metaheuristic