An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem.
Zhi-Yuan WangQuan-Ke PanLiang GaoYu-Long WangPublished in: Swarm Evol. Comput. (2022)
Keyphrases
- scheduling problem
- single machine
- minimize total
- greedy algorithm
- flowshop
- total flowtime
- permutation flowshop
- parallel machines
- release dates
- maximum lateness
- processing times
- minimizing makespan
- sequence dependent setup times
- total weighted tardiness
- setup times
- np hard
- precedence constraints
- tabu search
- flowshop scheduling
- worst case
- dynamic programming
- single machine scheduling problem
- objective function
- special case
- total cost
- competitive ratio
- strongly np hard
- completion times
- knapsack problem
- feasible solution