A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem.
Shuai ChenQuan-Ke PanLiang GaoHong-yan SangPublished in: Eng. Appl. Artif. Intell. (2021)
Keyphrases
- scheduling problem
- minimize total
- greedy algorithm
- single machine
- flowshop
- total flowtime
- permutation flowshop
- parallel machines
- release dates
- processing times
- maximum lateness
- flowshop scheduling
- minimizing makespan
- sequence dependent setup times
- np hard
- precedence constraints
- setup times
- tabu search
- worst case
- total tardiness
- objective function
- job shop scheduling problem
- dynamic programming
- knapsack problem
- special case
- competitive ratio
- completion times
- simulated annealing
- total cost
- particle swarm optimization