A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times.
H. S. MirsaneiMostafa ZandiehMajid Javid MoayedMahmood Reza KhabbaziPublished in: J. Intell. Manuf. (2011)
Keyphrases
- simulated annealing algorithm
- sequence dependent setup times
- flowshop
- scheduling problem
- simulated annealing
- single machine
- setup times
- tabu search
- single machine scheduling problem
- precedence constraints
- parallel machines
- genetic algorithm
- release dates
- search algorithm
- processing times
- lot sizing
- special case
- np hard
- mutation operator
- premature convergence
- optimal solution
- neural network
- hybrid algorithm
- multi objective