A collaborative iterative greedy algorithm for the scheduling of distributed heterogeneous hybrid flow shop with blocking constraints.
Hao-Xiang QinYu-Yan HanYi-Ping LiuJun-Qing LiQuan-Ke PanXue HanPublished in: Expert Syst. Appl. (2022)
Keyphrases
- greedy algorithm
- scheduling problem
- flowshop
- distributed heterogeneous
- permutation flowshop
- total flowtime
- precedence constraints
- job shop
- unrelated parallel machines
- setup times
- single machine
- sequence dependent setup times
- greedy algorithms
- parallel machines
- squeaky wheel
- maximum lateness
- minimizing makespan
- processing times
- flowshop scheduling problems
- worst case
- influence maximization
- dynamic programming
- special case
- np hard
- greedy strategy
- manufacturing cell
- flowshop scheduling
- resource constraints
- tabu search
- release dates
- objective function
- data sources
- job shop scheduling problem
- upper bound
- lot streaming
- influence spread
- lower bound
- completion times