Combinatorial particle swarm optimization for solving blocking flowshop scheduling problem.
Mansour EddalyBassem JarbouiPatrick SiarryPublished in: J. Comput. Des. Eng. (2016)
Keyphrases
- scheduling problem
- flowshop
- particle swarm optimization
- minimizing makespan
- single machine
- strongly np hard
- total flowtime
- setup times
- processing times
- minimizing total tardiness
- flowshop scheduling
- permutation flowshop
- sequence dependent setup times
- tabu search
- pso algorithm
- makespan minimization
- total tardiness
- bicriteria
- special case
- maximum lateness
- precedence constraints
- flowshop scheduling problems
- np hard
- differential evolution
- parallel machines
- ant colony optimization
- total weighted tardiness
- multi objective
- maximum tardiness
- unrelated parallel machines
- combinatorial optimization
- preventive maintenance
- release dates
- hybrid algorithm
- search algorithm
- neural network