An Adaptive Population-based Iterative Greedy Algorithm for Optimizing the Maximum Completion Time of Hybrid Flow Shop.
Fuyou MaoXiyang LiuHaomin ZhaoPublished in: ICCCV (2022)
Keyphrases
- greedy algorithm
- flowshop
- scheduling problem
- total flowtime
- permutation flowshop
- flowshop scheduling problems
- minimizing makespan
- flowshop scheduling
- tabu search
- processing times
- greedy algorithms
- special case
- lot streaming
- dynamic programming
- worst case
- sequence dependent setup times
- asymptotic optimality
- setup times
- objective function
- greedy strategy
- set cover
- knapsack problem
- differential evolution
- influence maximization
- simulated annealing
- single machine
- np hard
- precedence constraints
- parallel machines
- approximation guarantees
- multistage
- greedy heuristic
- single machine scheduling problem
- flexible manufacturing systems
- linear programming
- neural network