An Efficient Iterated Greedy Algorithm for the Makespan Blocking Flow Shop Scheduling Problem.
Nouri NouhaTalel LadhariPublished in: Polibits (2016)
Keyphrases
- greedy algorithm
- iterated greedy
- permutation flowshop
- worst case
- greedy algorithms
- dynamic programming
- greedy heuristic
- greedy strategy
- scheduling problem
- knapsack problem
- set cover
- objective function
- randomized algorithm
- influence maximization
- np hard
- approximation ratio
- influence spread
- greedy approximation algorithm
- social network analysis
- processing times
- search engine
- optimal solution
- structured sparsity