Solving the Flow Shop Problem by Parallel Tabu Search.
Wojciech BozejkoMieczyslaw WodeckiPublished in: PARELEC (2002)
Keyphrases
- tabu search
- flowshop
- scheduling problem
- metaheuristic
- simulated annealing
- search heuristics
- memetic algorithm
- parallel machines
- feasible solution
- job shop
- vehicle routing problem
- iterated local search
- setup times
- path relinking
- processing times
- test problems
- genetic algorithm
- job shop scheduling problem
- sequence dependent setup times
- hybrid algorithm
- search procedure
- search algorithm
- search algorithm for solving
- combinatorial optimization
- heuristic methods
- benchmark instances
- timetabling problem
- initial solution
- scatter search
- multi start
- tabu search algorithm
- tabu list
- special case
- max sat
- variable neighborhood search
- candidate list
- np hard
- single machine
- parallel computing
- search space
- job shop scheduling
- hill climbing
- computational complexity