An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance.
S. ChandrasekaranR. K. SureshS. G. PonnambalamN. VijayakumarPublished in: CASE (2006)
Keyphrases
- particle swarm optimization algorithm
- flowshop scheduling problems
- total flowtime
- permutation flowshop
- scheduling problem
- flowshop scheduling
- minimizing makespan
- particle swarm optimization
- flowshop
- convergence speed
- particle swarm
- pso algorithm
- upper bound
- global search
- inertia weight
- multilevel thresholding
- greedy algorithm
- single machine
- processing times
- np hard
- sequence dependent setup times
- strongly np hard
- setup times
- global optimization