A particle swarm optimization approach for permutation flow shop scheduling problem
Flow shop scheduling problem (FSSP) is a combinatorial optimization problem. This work, with the objective of optimizing the makespan of an FSSP uses a particle swarm optimization (PSO) approach. The problems are tested on Taillard’s benchmark problems. The results of Nawaz, Encore and Ham (NEH) heu...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2014-01-01
|
| Series: | International Journal for Simulation and Multidisciplinary Design Optimization |
| Subjects: | |
| Online Access: | https://www.ijsmdo.org/articles/smdo/full_html/2014/01/smdo130006/smdo130006.html |