A hybrid algorithm to minimize makespan for the permutation flow shop scheduling problem.
Fardin AhmadizarFarnaz BarzinpourPublished in: Int. J. Comput. Intell. Syst. (2010)
Keyphrases
- hybrid algorithm
- simulated annealing
- particle swarm optimization
- tabu search
- ant algorithm
- differential evolution
- hybrid method
- premature convergence
- ant colony optimization
- genetic algorithm
- standard test problems
- particle swarm optimization pso
- imperialist competitive algorithm
- hybrid optimization algorithm
- artificial bee colony algorithm
- optimal solution
- hybrid algorithms
- initial population
- initial solution
- ant colony optimization algorithm
- evolutionary algorithm
- flowshop
- hybrid particle swarm optimization
- particle swarm algorithm
- optimization method
- biogeography based optimization
- special case