Particle swarm optimization algorithm for permutation flowshop sequencing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3172 LNCS, Issue , 2004, Pages 382-389

  Tasgetiren, M Fatih ^a   Sevkli, Mehmet ^a   Liang, Yun Chia ^b   Gencyilmaz, Gunes ^c  

^a FATIH UNIVERSITY   (Turkey)

^b YUAN ZE UNIVERSITY   (Taiwan)

^c ISTANBUL KULTUR UNIVERSITY   (Turkey)

Author keywords

[No Author keywords available]

Indexed keywords

ANT COLONY OPTIMIZATION; SWARM INTELLIGENCE; ALGORITHMS; ARTIFICIAL INTELLIGENCE; PARTICLE SWARM OPTIMIZATION (PSO);

BENCHMARK SUITES; LOCAL SEARCH; MAKESPAN CRITERION; PARTICLE SWARM OPTIMIZATION ALGORITHM; PERMUTATION FLOW SHOPS; PSO ALGORITHMS; SEQUENCING PROBLEMS; VARIABLE NEIGHBORHOOD SEARCH;

PARTICLE SWARM OPTIMIZATION (PSO); OPTIMIZATION;

EID: 47949089702     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28646-2_38     Document Type: Conference Paper

References (20)

1. Abido, M.A.: Optimal power flow using particle swarm optimization, Electrical Power and Energy Systems, 24, (2002), pp.563-571.
2. Bean, J.C.: Genetic algorithm and random keys for sequencing and optimization, ORSA journal on computing,6(2), (1994), pp.154-160
3. Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory, Proc. of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, (1995), pp.39-43.
4. Framinan, J.M., Leisten, R.: An efficient constructive heuristic for flowtime minimisation in permutation flow shops, Omega, 31, (2003), pp.311-317
5. Grabowski, J., Wodecki, M.: A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion, Computers and Operations Research, 31(11), (2004), pp.1891-1909.
6. Hu, X., Eberhard, R.C.,Shi, Y.: Swarm Intelligence for Permutation optimization: A case study of n-Queens problem,Proc. of the 2003 IEEE Swarm Intelligence Symposium,Indianapolis,IN, (2003), pp.243-246
7. Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm intelligence, Morgan Kaufmann, San Mateo, (2001), CA
8. Mladenovic, N., Hansen, P.: Variable Neighborhood Search, Computers and Operations Research, 24, (1997), 1097-1100.
9. Nawaz, M., Enscore Jr, E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, Omega, 11(1), (1983), pp.91-95.
10. Onwubolu, G.C., Clerc, M.: Optimal operating path for automated drilling operations by a new heuristic approach using particle swarm optimisation, International Journal of Production Research, 42(3), (2004), pp.473-491.
11. Nowicki, E., Smutnicki, C.: A fast tabu search algorithm for the permutation flowshop problem, European Journal of Operational Research, 91, (1996), pp.160-175.
12. Osman, I., Potts, C.: Simulated annealing for permutation flow shop scheduling, Omega, 17(6), (1989), pp.551-557.
13. Reeves, C., Yamada, T.: Genetic algorithms, path relinking and the flowshop sequencing problem, Evolutionary Computation, 6, (1998) pp.45-60.
14. Rinnooy Kan, A.H.G: Machine scheduling problems: Classification, complexity and computations, Nijhoff, The Hague, (1976).
15. Salman, A., Ahmad, I., Al-Madani, S.: Particle swarm optimization for task assignment problem, Microprocessors and Microsystems, 26, (2003), pp.363-371.
16. Stützle, T.: Applying iterated local search to the permutation flowshop problem", Technical Report, AIDA-98-04, (1998), Darmstad University of Technology, Darmstad, Germany.
17. Stützle, T.: An ant approach to the flowshop problem,In Proc. of EUFIT'98, (1998), pp.1560-1564.
18. Taillard, E.: Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, (1993), pp.278-285.
19. Tasgetiren, M.F., Sevkli, M.,Liang, Y.-C., Gencyilmaz, G.: Particle swarm optimization algorithm for single machine total weighted tardiness problem, Proc. of the 2004 Congress on Evolutionary Computation(to appear).
20. Watson, J.P., Barbulescu, L., Whitley, L.D., Howe, A.E.: Contrasting structured and Random Permutation Flowshop Scheduling Problems: Search space Topology and Algorithm Performance, ORSA Journal of Computing, 14(2), (2002), pp.98-123