A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
Genetic algorithms for flowshop scheduling problems
Computers and Industrial Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Genetic algorithms, path relinking, and the flowshop sequencing problem
Evolutionary Computation
IEEE Transactions on Evolutionary Computation
An Improved Discrete Particle Swarm Optimization Algorithm for TSP
WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
An improved particle swarm optimization algorithm for flowshop scheduling problem
Information Processing Letters
A discrete differential evolution algorithm for the permutation flowshop scheduling problem
Computers and Industrial Engineering
An alternate two phases particle swarm optimization algorithm for flow shop scheduling problem
Expert Systems with Applications: An International Journal
Synchronous parallelization of Particle Swarm Optimization with digital pheromones
Advances in Engineering Software
Chaotic particle swarm optimization for assembly sequence planning
Robotics and Computer-Integrated Manufacturing
A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem
Computers and Industrial Engineering
The circular discrete particle swarm optimization algorithm for flow shop scheduling problem
Expert Systems with Applications: An International Journal
A study on the effect of vmax in particle swarm optimisation with high dimension
International Journal of Bio-Inspired Computation
Expert Systems with Applications: An International Journal
A hybrid discrete particle swarm algorithm for open-shop problems
SEAL'06 Proceedings of the 6th international conference on Simulated Evolution And Learning
New Hybrid Discrete PSO for Solving Non Convex Trim Loss Problem
International Journal of Applied Evolutionary Computation
Hi-index | 0.01 |
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.