Article ID: | iaor20084396 |
Country: | Netherlands |
Volume: | 177 |
Issue: | 3 |
Start Page Number: | 1930 |
End Page Number: | 1947 |
Publication Date: | Mar 2007 |
Journal: | European Journal of Operational Research |
Authors: | Liang Yun-Chia, Tasgetiren M. Fatih, Sevkli Mehmet, Gencyilmaz Gunes |
Keywords: | heuristics |
In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutation flowshop sequencing problem (PFSP) with the objectives of minimizing makespan and the total flowtime of jobs. For this purpose, a heuristic rule called the smallest position value (SPV) borrowed from the random key representation of Bean was developed to enable the continuous particle swarm optimization algorithm to be applied to all classes of sequencing problems. In addition, a very efficient local search, called variable neighborhood search (VNS), was embedded in the PSO algorithm to solve the well known benchmark suites in the literature. The PSO algorithm was applied to both the 90 benchmark instances provided by Taillard, and the 14,000 random, narrow random and structured benchmark instances provided by Watson