A Multipopulation PSO Based Memetic Algorithm for Permutation Flow Shop Scheduling
The permutation flow shop scheduling problem (PFSSP) is part of production scheduling, which belongs to the hardest combinatorial optimization problem. In this paper, a multipopulation particle swarm optimization (PSO) based memetic algorithm (MPSOMA) is proposed in this paper. In the proposed algo...
Збережено в:
| Автори: | , , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Wiley
2013-01-01
|
| Серія: | The Scientific World Journal |
| Онлайн доступ: | http://dx.doi.org/10.1155/2013/387194 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|