A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem.
Quan-Ke PanMehmet Fatih TasgetirenYun-Chia LiangPublished in: Comput. Oper. Res. (2008)
Keyphrases
- particle swarm optimization algorithm
- flowshop
- scheduling problem
- particle swarm optimization
- minimizing makespan
- setup times
- convergence speed
- minimizing total tardiness
- processing times
- total flowtime
- single machine
- particle swarm
- sequence dependent setup times
- total tardiness
- special case
- tabu search
- makespan minimization
- bicriteria
- pso algorithm
- flowshop scheduling
- permutation flowshop
- precedence constraints
- maximum lateness
- np hard
- evolution strategy
- parallel machines
- total weighted tardiness
- particle swarm optimization pso
- strongly np hard
- release dates
- preventive maintenance
- search algorithm
- cost function
- multi objective
- flowshop scheduling problems
- dynamic programming