Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem.
Federico Della CroceThierry GaraixAndrea GrossoPublished in: Comput. Oper. Res. (2012)
Keyphrases
- total tardiness
- iterated local search
- parallel machines
- flowshop
- scheduling problem
- tabu search
- metaheuristic
- multi start
- sequence dependent setup times
- single machine
- vehicle routing problem with time windows
- vehicle routing problem
- setup times
- precedence constraints
- shared memory
- release dates
- parallel computing
- feasible solution
- processing times
- special case
- search space
- np hard
- single server
- genetic algorithm
- ant colony optimization
- multi objective
- simulated annealing
- upper bound