Iterated Local Search with Path Relinking for Solving Parallel Machines Scheduling Problem with Resource-Assignable Sequence Dependent Setup Times.
Edmar Hell KamkeJosé Elias Claudio ArroyoAndré Gustavo dos SantosPublished in: EvoCOP (2010)
Keyphrases
- tabu search
- scheduling problem
- path relinking
- sequence dependent setup times
- iterated local search
- parallel machines
- multi start
- flowshop
- single machine
- metaheuristic
- total tardiness
- precedence constraints
- setup times
- feasible solution
- strongly np hard
- search procedure
- memetic algorithm
- scatter search
- release dates
- np hard
- vehicle routing problem
- combinatorial optimization
- processing times
- job shop scheduling problem
- variable neighborhood search
- single server
- resource consumption
- single machine scheduling problem
- search algorithm
- solution quality
- branch and bound algorithm
- traveling salesman problem
- optimization problems
- simulated annealing
- special case
- optimal solution
- parallel computing
- lot sizing
- vehicle routing problem with time windows
- multi objective