Publication Type:

Conference Proceedings

Source:

Lecture Notes in Computer Science (LNCS),, Volume 3612, p.572 – 581 (2005)

URL:

https://doi.org/10.1007/11539902_7

Abstract:

In this paper a discrete particle swarm optimization (DPSO) algorithm is proposed to solve permutation flowshop scheduling problems with the objective of minimizing the makespan. A discussion on implementation details of DPSO algorithm is presented. The proposed algorithm has been applied to a set of benchmark problems and performance of the algorithm is evaluated by comparing the obtained results with the results published in the literature. Further, it is found that the proposed improvement heuristic algorithm performs better when local search is performed. The results are presented.

Cite this Research Publication

K. Rameshkumar, Suresh, R. K., K., M., and .M, K., “Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan”, Lecture Notes in Computer Science (LNCS), vol. 3612. pp. 572 – 581, 2005.