Solving bi-objective flow shop problem with hybrid path relinking algorithm.
Rong-Qiang ZengMatthieu BasseurJin-Kao HaoPublished in: Appl. Soft Comput. (2013)
Keyphrases
- bi objective
- scheduling problem
- computational complexity
- dynamic programming
- ant colony optimization
- optimal solution
- cost function
- optimization algorithm
- search space
- np hard
- worst case
- objective function
- mathematical model
- combinatorial optimization
- scatter search
- multi objective optimization
- benchmark problems
- computationally efficient
- simulated annealing