A Variable Neighborhood Descent as ILS local search to the minimization of the total weighted tardiness on unrelated parallel machines and sequence dependent setup times.
Rodney O. M. DianaSérgio Ricardo de SouzaMoacir F. F. FilhoPublished in: Electron. Notes Discret. Math. (2018)
Keyphrases
- multi start
- sequence dependent setup times
- total weighted tardiness
- parallel machines
- tabu search
- scheduling problem
- setup times
- flowshop
- single machine
- precedence constraints
- path relinking
- metaheuristic
- release dates
- lot sizing
- processing times
- single machine scheduling problem
- memetic algorithm
- feasible solution
- job shop scheduling problem
- lagrangian relaxation
- search procedure
- simulated annealing
- parallel computing
- np hard
- objective function
- multi item
- single server
- shared memory
- vehicle routing problem
- multistage
- variable neighborhood search
- computational complexity