A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem.
Mehmet Fatih TasgetirenYun-Chia LiangMehmet SevkliGünes GençyilmazPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- particle swarm optimization algorithm
- permutation flowshop
- total flowtime
- scheduling problem
- minimizing makespan
- flowshop scheduling problems
- upper bound
- particle swarm optimization
- convergence speed
- single machine
- greedy algorithm
- strongly np hard
- objective function
- np hard
- pso algorithm
- flowshop
- processing times
- global optimization
- setup times
- particle swarm optimization pso
- differential evolution
- precedence constraints
- release dates
- steady state
- optimization algorithm
- search algorithm