Modified self-adaptive local search algorithm for a biobjective permutation flow shop scheduling problem.
Cigdem Alabas-UsluBerna DengizCanan AglanIhsan SabuncuogluPublished in: Turkish J. Electr. Eng. Comput. Sci. (2019)
Keyphrases
- bi objective
- search algorithm
- efficient solutions
- minimum cost flow
- multi objective
- set covering problem
- network design
- multi objective optimization
- ant colony optimization
- heuristic search
- multiple objectives
- shortest path problem
- branch and bound
- search space
- knapsack problem
- nsga ii
- evolutionary algorithm
- genetic algorithm
- tabu search