A hybrid iterated greedy algorithm for the distributed no-wait flow shop scheduling problem.
Weishi ShaoDechang PiZhongshi ShaoPublished in: CEC (2017)
Keyphrases
- greedy algorithm
- iterated greedy
- scheduling problem
- permutation flowshop
- greedy algorithms
- worst case
- total flowtime
- np hard
- dynamic programming
- squeaky wheel
- flowshop
- set cover
- objective function
- greedy strategy
- single machine
- greedy heuristic
- knapsack problem
- minimizing makespan
- setup times
- submodular functions
- influence maximization
- parallel machines
- processing times
- randomized algorithm
- approximation algorithms
- influence spread
- machine learning