Solving the Flow Shop Problem by Parallel Simulated Annealing.
Mieczyslaw WodeckiWojciech BozejkoPublished in: PPAM (2001)
Keyphrases
- flowshop
- simulated annealing
- tabu search
- scheduling problem
- combinatorial optimization
- flowshop scheduling problems
- flowshop scheduling
- processing times
- strongly np hard
- setup times
- parallel machines
- asymptotic optimality
- metaheuristic
- special case
- minimizing makespan
- search procedure
- lot streaming
- job shop
- simulated annealing algorithm
- genetic algorithm
- hybrid algorithm
- single machine
- sequence dependent setup times
- open shop
- np hard
- maximum lateness
- feasible solution
- job shop scheduling problem
- shared memory
- solution quality
- approximation algorithms
- upper bound
- job shop scheduling
- precedence constraints
- unrelated parallel machines