Performance evaluation of hybrid-CLP vs. GA: non-permutation flowshop with constrained resequencing buffers.
Gerrit FärberAnna M. Coves MorenoSaïd SalhiPublished in: Int. J. Manuf. Technol. Manag. (2010)
Keyphrases
- permutation flowshop
- scheduling problem
- genetic algorithm ga
- genetic algorithm
- total flowtime
- parallel genetic algorithm
- upper bound
- greedy algorithm
- constraint logic programming
- fitness function
- constraint programming
- multi objective
- particle swarm optimization
- hybrid algorithm
- strongly np hard
- metaheuristic
- np hard