A DE Based Variable Iterated Greedy Algorithm for the No-Idle Permutation Flowshop Scheduling Problem with Total Flowtime Criterion.
Mehmet Fatih TasgetirenQuan-Ke PanLing WangAngela Hsiang-Ling ChenPublished in: ICIC (2) (2011)
Keyphrases
- total flowtime
- greedy algorithm
- permutation flowshop
- minimizing makespan
- scheduling problem
- flowshop scheduling problems
- flowshop scheduling
- worst case
- flowshop
- dynamic programming
- greedy algorithms
- objective function
- np hard
- upper bound
- knapsack problem
- greedy strategy
- greedy heuristic
- response time
- set cover
- influence maximization
- website
- metaheuristic
- random walk
- linear programming
- greedy approximation algorithm