Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem

Soft Computing

Volumn 17, Issue 7, 2013, Pages 1159-1173

  Marinakis, Yannis ^a   Marinaki, Magdalene ^a  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

Expanding Neighborhood topology; Particle swarm optimization; Path relinking; Permutation flowshop scheduling problem; Variable neighborhood search

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; GLOBAL NEIGHBORHOOD STRUCTURES; HEURISTIC AND META HEURISTIC TECHNIQUES; LOCAL NEIGHBORHOOD STRUCTURES; NEIGHBORHOOD TOPOLOGY; PATH RELINKING; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; VARIABLE NEIGHBORHOOD SEARCH;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; PARTICLE SWARM OPTIMIZATION (PSO); SCHEDULING; TOPOLOGY;

ITERATIVE METHODS;

EID: 84878787429     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-013-0992-z     Document Type: Article

References (43)

1. Banks A, Vincent J, Anyakoha C (2007) A review of particle swarm optimization. Part I: background and development. Nat Comput 6(4): 467-484.
2. Banks A, Vincent J, Anyakoha C (2008) A review of particle swarm optimization. Part II: hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications. Nat Comput 7: 109-124.
3. Chen S-H, Chang P-C, Cheng TCE, Zhang Q (2012) A self-guided genetic algorithm for permutation flowshop scheduling problems. Comput Oper Res 39: 1450-1457.
4. Clerc M, Kennedy J (2002) The particle swarm: explosion, stability and convergence in a multi-dimensional complex space. IEEE Trans Evol Comput 6: 58-73.
5. Dueck G, Scheurer T (1990) Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J Comput Phys 90: 161-175.
6. Engelbrecht AP (2007) Computational intelligence: an introduction. 2nd edn. Wiley, England.
7. Gajpal Y, Rajendran C (2006) An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops. Int J Prod Econ 101(2): 259-272.
8. Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1: 117-129.
9. Glover F, Laguna M, Marti R (2003) Scatter search and path relinking: advances and applications. Handbook of metaheuristics. In: Glover F, Kochenberger GA (eds) Kluwer Academic Publishers, Boston, pp 1-36.
10. Grabowski J, Wodecki M (2004) A very fast Tabu search algorithm for the permutation flow shop problem with makespan criterion. Comput Oper Res 31: 1891-1909.
11. Gupta JND, Stafford EF Jr (2006) Flowshop scheduling research after five decades. Eur J Oper Res 169: 699-711.
12. Hansen P, Mladenovic N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130: 449-467.
13. Jarboui B, Ibrahim S, Siarry P, Rebai A (2008) A combinatorial particle swarm optimisation for solving permutation flow shop problems. Comput Ind Eng 54: 526-538.
14. Johnson S (1954) Optimal two-and-three stage production schedules with setup times included. Naval Res Logistics Q 1: 61-68.
15. Kennedy J, Eberhart R (1995) Particle swarm optimization. Proc AESF Annu Tech Conf 1995 IEEE Int Conf Neural Netw 4: 1942-1948.
16. Kennedy J (1997) The particle swarm: social adaptation of knowledge. In: Proceedings of the IEEE International Conference on Evolutionary Computation, pp 303-308.
17. Lian Z, Gu X, Jiao B (2006) A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Appl Math Comput 175(1): 773-785.
18. Liao C-J, Tseng C-T, Luarn P (2007) A discrete version of particle swarm optimization for flowshop scheduling problems. Comput Oper Res 34: 3099-3111.
19. Lichtblau D (2002) Discrete optimization using mathematica. World multi-conference on systemics, cybernetics and informatics (SCI 2002). In: Callaos N, Ebisuzaki T, Starr B, Abe JM, Lichtblau D (eds) International Institute of Informatics and Systemics, vol 16, pp 169-174.
20. Liu B, Wang L, Jin Y-H (2007) An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans Syst Man Cybernetics Part B Cybernetics 37(1): 18-27.
21. Liu Y-F, Liu S-Y (2011) A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem. Appl Soft Comput. doi: 10. 1016/j. asoc. 2011. 10. 024.
22. Lourenco HR, Martin O, Stϋtzle T (2002) Iterated local search. Handbook of metaheuristics. Vol. 57 of Operations Research and Management Science. Kluwer Academic Publishers, Boston, pp 321-353.
23. Morton TE, Pentico DW (1993) Heuristic scheduling systems with applications to production systems and project management. Wiley, New York.
24. Nowicki E, Smutnicki C (1996) A fast Tabu search algorithm for the permutation flow-shop problem. Eur J Oper Res 91: 160-175.
25. Pan Q-K, Tasgetiren MF, Liang Y-C (2008) A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput Ind Eng 55: 795-816.
26. Pinedo M (1995) Scheduling. Theory, algorithms, and systems. Prentice Hall, Englewood Cliffs.
27. Poli R, Kennedy J, Blackwell T (2007) Particle swarm optimization. An overview. Swarm Intell. 1: 33-57.
28. Rajendran C, Ziegler H (2004) Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. Eur J Oper Res 155(2): 426-438.
29. Rajendran C, Ziegler H (2005) Two ant-colony algorithms for minimizing total flowtime in permutation flowshops. Comput Ind Eng 48(4): 789-797.
30. Ruiz R, Maroto C (2005) A comprehensive review and evaluation of permutation flowshop heuristics. Eur J Oper Res 165: 479-494.
31. Ruiz R, Stützle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177: 2033-2049.
32. Ruiz R, Maroto C, Alcaraz J (2006) Two new robust genetic algorithms for the flowshop scheduling problem. Omega 34: 461-476.
33. Shi Y, Eberhart R (1998) A modified particle swarm optimizer. In: Proceedings of 1998 IEEE World Congress on Computational Intelligence, pp 69-73.
34. Suganthan PN (1999) Particle swarm optimiser with neighborhood operator. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp 1958-1962.
35. Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64: 278-285.
36. Tasgetiren M, Liang Y, Sevkli M, Gencyilmaz G (2007) A particle swarm optimization algorithm for makespan and total flow time minimization in the permutation flowshop sequencing problem. Eur J Oper Res 177: 1930-1947.
37. Tseng L-Y, Lin Y-T (2009) A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 198: 84-92.
38. Tseng L-Y, Lin Y-T (2010) A genetic local search algorithm for minimizing total flowtime in the permutation flowshop scheduling problem. Int J Prod Econ 127: 121-128.
39. Vallada E, Ruiz R (2009) Cooperative metaheuristics for the permutation flowshop scheduling problem. Eur J Oper Res 193: 365-376.
40. Ying KC, Liao CJ (2004) An ant colony system for permutation flow-shop sequencing. Comput Oper Res 31: 791-801.
41. Zhang C, Ning J, Ouyang D (2010) A hybrid alternate two phases particle swarm optimization algorithm for flow shop scheduling problem. Comput Ind Eng 58: 1-11.
42. Zhang C, Sun J, Zhu X, Yang Q (2008) An improved particle swarm optimization algorithm for flowshop scheduling problem. Inf Process Lett 108: 204-209.
43. Zobolas GI, Tarantilis CD, Ioannou G (2009) Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Comput Oper Res 36: 1249-1267.