AIV: A Heuristic Algorithm based on Iterated Local Search and Variable Neighborhood Descent for Solving the Unrelated Parallel Machine Scheduling Problem with Setup Times.
Matheus Nohra HaddadLuciano Perdigão CotaMarcone Jamilson Freitas SouzaNelson MaculanPublished in: ICEIS (1) (2014)
Keyphrases
- variable neighborhood descent
- iterated local search
- setup times
- flowshop
- sequence dependent setup times
- scheduling problem
- tabu search
- multi start
- metaheuristic
- path relinking
- single machine
- single machine scheduling problem
- processing times
- parallel machines
- variable neighborhood search
- special case
- vehicle routing problem with time windows
- vehicle routing problem
- feasible solution
- lot sizing
- search procedures
- job shop scheduling problem
- memetic algorithm
- precedence constraints
- hybrid algorithm
- multi item
- search procedure
- combinatorial optimization
- optimization problems
- heuristic methods
- np hard
- branch and bound algorithm
- global optimization
- stochastic approximation
- simulated annealing