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 algor...
| Main Authors: | , , , |
|---|---|
| Format: | Online |
| Language: | English |
| Published: |
Hindawi Publishing Corporation
2013
|
| Online Access: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3876833/ |