An iterated greedy algorithm for the hybrid flowshop problem with makespan criterion.
Damla KizilayMehmet Fatih TasgetirenQuan-Ke PanLing WangPublished in: CIPLS (2014)
Keyphrases
- total flowtime
- greedy algorithm
- permutation flowshop
- flowshop
- scheduling problem
- minimizing makespan
- flowshop scheduling problems
- iterated greedy
- maximum tardiness
- worst case
- processing times
- greedy algorithms
- dynamic programming
- special case
- sequence dependent setup times
- flowshop scheduling
- influence maximization
- greedy strategy
- tabu search
- upper bound
- objective function
- bicriteria
- setup times
- maximum lateness
- knapsack problem
- precedence constraints
- random walk
- lot streaming
- evolutionary algorithm
- computational complexity