A Quantum-inspired Iterated Greedy algorithm for permutation flowshops with total flowtime minimization.
Yi ZhangXiaoping LiPublished in: SMC (2010)
Keyphrases
- total flowtime
- greedy algorithm
- quantum inspired
- permutation flowshop
- objective function
- binary gravitational search algorithm
- scheduling problem
- squeaky wheel
- flowshop scheduling problems
- quantum computing
- minimizing makespan
- greedy algorithms
- immune clonal
- worst case
- greedy strategy
- flowshop
- mutation operator
- knapsack problem
- influence maximization
- genetic algorithm
- optimization problems
- neural network
- flowshop scheduling
- binary particle swarm optimization
- single machine
- setup times
- precedence constraints
- dynamic programming
- learning algorithm