Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines.
Chinyao LowPublished in: Comput. Oper. Res. (2005)
Keyphrases
- unrelated parallel machines
- scheduling problem
- flowshop
- simulated annealing
- tabu search
- setup times
- parallel machines
- single machine
- processing times
- metaheuristic
- job shop scheduling problem
- precedence constraints
- genetic algorithm
- maximum lateness
- np hard
- evolutionary algorithm
- search procedure
- job shop
- minimizing makespan
- solution quality
- feasible solution
- benchmark problems
- sequence dependent setup times
- job shop scheduling
- hybrid algorithm
- combinatorial optimization
- strongly np hard
- open shop
- hill climbing
- completion times
- scheduling jobs