A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems
This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simul...
| Asıl Yazarlar: | , |
|---|---|
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Wiley
2014-01-01
|
| Seri Bilgileri: | The Scientific World Journal |
| Online Erişim: | http://dx.doi.org/10.1155/2014/902950 |