A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem

Expert Systems with Applications

Volumn 38, Issue 4, 2011, Pages 4348-4360

  Liu, Hongcheng ^a   Gao, Liang ^a   Pan, Quanke ^b  

^a HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

^b LIAOCHENG UNIVERSITY   (China)

Author keywords

EDA; Flowshop; Metaheuristics; PSO

Indexed keywords

BENCHMARK SUITES; CANONICAL PSO; COMPUTATIONAL EXPERIMENT; EDA; ESTIMATION OF DISTRIBUTION ALGORITHMS; FLOW-SHOPS; HYBRID PARTICLE SWARM OPTIMIZATION; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; META HEURISTICS; NP COMPLETE PROBLEMS; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; PSO; SOCIAL COGNITION; WAITING-TIME;

COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; MATHEMATICAL OPERATORS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 78650704810     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.09.104     Document Type: Article

References (32)

1. A. Banks, J. Vincent, and C. Anyakoha A review of particle swarm optimization. Part I: Background and development Natural Computing 6 2007 467 484
2. A. Banks, J. Vincent, and C. Anyakoha A review of particle swarm optimization. Part II: Hybridisation, combinatorial, multicriteria and constrained optimization, and indicative applications Natural Computing 7 2008 109 124
3. J.C. Bean Genetic algorithms and random keys for sequencing and optimization ORSA Journal of Computing 6 2 1994 154 160
4. Chandrasekaran, S.; Ponnambalam, S. G.; Suresh, R. K.; Vijayakumar, N. (2006). A hybrid discrete particle swarm optimization algorithm to solve flow shop scheduling problems. In CIS, 2006. IEEE.
5. J.M. Framinan, R. Leisten, and R. Ruiz-Usano Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation European Journal of Operational Research 141 2002 559 569
6. P. Hansen, and N. Mladenovíc An introduction to variable neighborhood search Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization 1999
7. Iqbal, M.; Oca, M. A. M. D. (2006). An estimation of distribution particle swarm optimization algorithm. In ANTS 2006. LNCS (Vol. 4150, pp. 72-83).
8. B. Jarboui, M. Eddaly, and P. Siarry An estimation of distribution algorithm for minimizing the total flow time in permutation flowshop scheduling problems Computers and Operations Research 36 2009 2638 2646
9. S.M. Johnson Optimal two- and three-stage production schedules with setup times included Naval Research Logistics Quarterly 1 1954 61 68
10. Kaewkamnerdpong, B.; Bentley, P. (2005). Perceptive particle swarm optimization. In The 7th international conference on adaptive and natural computing algorithms (ICCANGA 2005), 2005.
11. A.H.G.R. Kan Machine scheduling problems: Classification, complexity and computations 1976 Martinus Nijhoff The Hague
12. Kennedy, J.; Eberhart, R. (1995). Particle swarm optimization. In Proceedings of IEEE international conference on neural networks, Piscataway, NJ, 1995 (pp. 1942-1948).
13. P. Larraanaga, and J.A. Lozano Estimation of distribution algorithms: A new tool for evolutionary computation 2002 Kluwer Academic Publishers Boston/Dordrecht/London
14. Z. Lian, X. Gu, and B. Jiao A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan Chaos, Solitons and Fractals 35 2008 851 861
15. B. Liu, L. Wang, and Y. Jin An effective PSO-based memetic algorithm for flow shop scheduling IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics 37 1 2007
16. J.A. Lozano, P. Larranaga, I. Inza, and E. Bengoetxea Towards a new evolutionary computation advances on estimation of distribution algorithms 2006 Springer Berlin
17. Nawaz, M.; Enscore, E. E.; Ham, I. (1983). Heuristic algorithm for the m-machine, n-job flowshop sequencing problem. In OMEGA, 1983.
18. PaaG, M. H. (1996). From recombination of genes to the estimation of distribution. Binary parameters. In Parallel problem solving from nature, PPSN, 1996, IV. Lecture notes in computer science (Vol. 1411, pp.178-787).
19. D. Palmer Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining near optimum Operational Research Quarterly 16 1 1965 101 107
20. Q.-K. Pan, Ling Wang, M.F. Tasgetiren, and B-H. Zhao A hybrid discrete particle swarm optimization algorithm for the no-wait flow shop scheduling problem with makespan criterion International Journal of Advanced Manufacturing Technology 38 2008 337 347
21. Rameshkumar, K.; Suresh R. K.; Mohanasundaram, K. M. (2005). Discrete particle swarm optimization (DPSO) algorithm for permutation flowshop scheduling to minimize makespan. In ICNC 2005. LNCS (Vol. 3612, pp. 572-581).
22. Santana, R.; Larrañaga, P.; Lozano, J. A. (2008). Adaptive estimation of distribution algorithms. In Adaptive and multilevel metaheuristics, SCI (Vol. 136, pp. 177-197).
23. R. Santana, P. Larrañaga, and J.A. Lozano Research topics in discrete estimation of distribution algorithms based on factorizations Memetic Computing 1 2009 35 54
24. Tasgetiren, M. F.; Sevkli, M.; Liang, Y.-C.; Gencyilmaz, G. (2004). Particle swarm optimization algorithm for single machine total weighted tardiness problem. In Proceedings of the 2004 congress on evolutionary computation, 2004.
25. M.F. Tasgetiren, Y-C. Liang, M. Sevkli, and G. Gencyilmaz A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem European Journal of Operational Research 177 2007 1930 1947
26. Toussaint, M. (2003). The structure of evolutionary exploration: On crossover, buildings blocks, and estimation-of-distribution algorithms. In GECCO 2003. LNCS (Vol. 2724, pp. 1444-1456).
27. Ucara, H.; Tasgetiren, M. F. (2006). A particle swarm optimization algorithm for permutation flow shop sequencing problem with the number of tardy jobs criterion. In Proceedings of 5th international symposium on intelligent manufacturing systems, May 29-31, 2006 (pp. 1110-1120).
28. S. Voß Meta-heuristics: The state of the art. Local search for planning and scheduling LNAI 2148 2001 1 23
29. Wang, J. (2007a). A novel discrete particle swarm optimization based on estimation of distribution. In ICIC 2007, LNAI (Vol. 4682, pp. 791-802).
30. Wang, J. (2007b). Genetic particle swarm optimization based on estimation of distribution. In LSMS 2007. LNCS (Vol. 4688, pp. 287-296).
31. J.P. Watson, L. Barbulescu, L.D. Whitley, and A.E. Howe structured and random permutation flowshop scheduling problems: Search space topology and algorithm performance ORSA Journal of Computing 14 2 2002 98 123
32. Yuan, K, Henequin, S, Wang, X & Gao, L. (2006). A new heuristic-EM for permutation flowshop scheduling. In Proceedings of the 12th IFAC symposium on information control problems in manufacturing (INCOM06), Saint-Etienne, France, May 17-19, 2006.