A novel collaborative iterative greedy algorithm for hybrid flowshop scheduling problem with batch processing machines and variable sublots.
Chengshuai LiYuyan HanBiao ZhangYuting WangJunqing LiKaizhou GaoPublished in: Int. J. Prod. Res. (2024)
Keyphrases
- flowshop
- greedy algorithm
- maximum lateness
- scheduling problem
- batch processing machines
- lot streaming
- total flowtime
- single machine
- permutation flowshop
- sequence dependent setup times
- minimizing makespan
- squeaky wheel
- processing times
- setup times
- total tardiness
- dynamic programming
- flowshop scheduling
- precedence constraints
- parallel machines
- tabu search
- special case
- release dates
- worst case
- np hard
- objective function
- minimizing total tardiness
- strongly np hard
- knapsack problem
- single machine scheduling problem
- genetic algorithm
- preventive maintenance
- particle swarm optimization
- upper bound