Variable Neighborhood Descent for the Unrelated Parallel Machine Scheduling Problem.
Christoforos CharalambousKrzysztof FleszarPublished in: Int. J. Artif. Intell. Tools (2012)
Keyphrases
- parallel machine scheduling problem
- variable neighborhood descent
- scheduling problem
- tabu search
- path relinking
- multi start
- variable neighborhood search
- release dates
- search procedures
- parallel machines
- single machine scheduling problem
- single machine
- scatter search
- metaheuristic
- np hard
- search algorithm
- global optimization
- precedence constraints
- search procedure
- flowshop
- solution quality
- benchmark instances
- heuristic methods
- job shop scheduling problem
- feasible solution
- objective function