Particle Swarm Optimization Algorithm for Permutation Flowshop Sequencing Problem
- 1 January 2004
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterionComputers & Operations Research, 2004
- Optimal path for automated drilling operations by a new heuristic approach using particle swarm optimizationInternational Journal of Production Research, 2004
- An efficient constructive heuristic for flowtime minimisation in permutation flow shopsOmega, 2003
- A new optimizer using particle swarm theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Optimal power flow using particle swarm optimizationInternational Journal of Electrical Power & Energy Systems, 2002
- Variable neighborhood searchComputers & Operations Research, 1997
- A fast tabu search algorithm for the permutation flow-shop problemEuropean Journal of Operational Research, 1996
- Genetic Algorithms and Random Keys for Sequencing and OptimizationINFORMS Journal on Computing, 1994
- Simulated annealing for permutation flow-shop schedulingOmega, 1989
- A heuristic algorithm for the m-machine, n-job flow-shop sequencing problemOmega, 1983