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

@inproceedings{Rameshkumar2005DiscretePS,
  title={Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan},
  author={K. Rameshkumar and R. K. Suresh and K. M. Mohanasundaram},
  booktitle={ICNC},
  year={2005}
}
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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 30 CITATIONS

A comparative study of four metaheuristics applied for solving the flow-shop scheduling problem

  • 2015 5th World Congress on Information and Communication Technologies (WICT)
  • 2015
VIEW 7 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED