Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem.
Federico Della CroceThierry GaraixAndrea GrossoPublished in: CoRR (2018)
Keyphrases
- total tardiness
- iterated local search
- parallel machines
- flowshop
- scheduling problem
- tabu search
- metaheuristic
- multi start
- single machine
- sequence dependent setup times
- vehicle routing problem with time windows
- vehicle routing problem
- setup times
- precedence constraints
- feasible solution
- processing times
- np hard
- special case
- shared memory
- release dates
- parallel computing
- single server
- hybrid algorithm
- simulated annealing
- lower bound
- optimal solution
- lot sizing
- ant colony optimization
- computer systems
- optimization problems