Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan

• Published in: Advances in Natural Computation pp. 572 - 581
• Main Authors: Rameshkumar, K., Suresh, R. K., Mohanasundaram, K. M.
• Format: Book Chapter Conference Proceeding
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2005; Springer
• Series: Lecture Notes in Computer Science
• Subjects: Applied sciences; Artificial intelligence; Computer science; control theory; systems; Constructive Heuristic; Exact sciences and technology; Flowshop Schedule Problem; Large Size Problem; Local Search; Optimal Power Flow; Local search; Permutation; Heuristic method; Discrete programming; Flow shop; Swarm intelligence; Scheduling; Makespan

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 o...