A cooperative population-based iterated greedy algorithm for distributed permutation flowshop group scheduling problem.
Hui ZhaoQuan-Ke PanKai-Zhou GaoPublished in: Eng. Appl. Artif. Intell. (2023)
Keyphrases
- permutation flowshop
- greedy algorithm
- cooperative
- scheduling problem
- total flowtime
- iterated greedy
- greedy algorithms
- greedy strategy
- objective function
- worst case
- flowshop
- upper bound
- knapsack problem
- single machine
- greedy heuristic
- set cover
- tabu search
- particle swarm optimization
- dynamic programming
- np hard
- influence maximization
- strongly np hard
- special case
- precedence constraints
- lower bound
- squeaky wheel