A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan Criterion.
Quan-Ke PanMehmet Fatih TasgetirenYun-Chia LiangPublished in: SGAI Conf. (2006)
Keyphrases
- particle swarm optimization algorithm
- permutation flowshop
- total flowtime
- scheduling problem
- upper bound
- minimizing makespan
- particle swarm optimization
- flowshop
- greedy algorithm
- convergence speed
- particle swarm
- pso algorithm
- strongly np hard
- inertia weight
- multilevel thresholding
- global search
- processing times
- single machine
- np hard
- tabu search
- evolution strategy
- precedence constraints
- markov chain
- evolutionary algorithm
- lower bound
- continuous domains
- global optimization
- release dates
- particle swarm optimization pso
- flowshop scheduling