Hybrid fuzzy logic-based particle swarm optimization for flow shop scheduling problem

International Journal of Computational Intelligence and Applications

Volumn 10, Issue 3, 2011, Pages 335-356

  Ling, Sai Ho ^a   Jiang, Frank ^b   Nguyen, Hung T ^a   Chan, Kit Yan ^c  

^a UNIVERSITY OF TECHNOLOGY SYDNEY   (Australia)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

^c CURTIN UNIVERSITY   (Australia)

Author keywords

Flow shop; fuzzy logic; particle swarm optimization; roulette wheel mechanism; scheduling

Indexed keywords

BENCHMARK FUNCTIONS; COMBINATORIAL OPTIMIZATION PROBLEMS; CONTROL PARAMETERS; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOPS; FUZZY INFERENCE SYSTEMS; HUMAN KNOWLEDGE; HYBRID PSO; INERTIA WEIGHT; LOCAL OPTIMA; LOCAL SEARCH; LOCAL SEARCH TECHNIQUES; MAKESPAN; OPERATION METHODS; PARTICLE SWARM; PERMUTATION FLOW-SHOP SCHEDULING; POLYNOMIAL-TIME; POSITION VALUE; ROULETTE WHEEL MECHANISM; SCHEDULING PROBLEM; SYSTEM-BASED; WHEEL MECHANISM;

COMBINATORIAL OPTIMIZATION; FUZZY INFERENCE; FUZZY LOGIC; FUZZY SYSTEMS; MACHINE SHOP PRACTICE; SCHEDULING; SCHEDULING ALGORITHMS; WHEELS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 80053985118     PISSN: 14690268     EISSN: None     Source Type: Journal    
DOI: 10.1142/S1469026811003136     Document Type: Article

References (37)

1. C. R. Reeves, A genetic algorithm for flowshop sequencing, Comput. Oper. Res. 22(1) (1995) 5-13.
2. G. I. Zobolas, C. D. Tarantilis and G. Ioannou, Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm, Computer and Operations Research 36 (2009) 1249-1267.
3. J. S. Chen, J. C. H. Pan and C. K. Wu, Hybrid tabu search for re-entrant permutation flow-shop scheduling problem, Expect System with Application 34 (2008) 1924-1930.
4. G. Onwubolo and D. Davendra, Scheduling flow shops using differential evolution algorithm, Eur. J. Oper. Res. 171 (2006) 6740-692.
5. C. Rajendran and H. Ziegler, Two ant-colony algorithms for minimizing total flowtime in permutation flowshops, Comput. & Ind. Engg. 48 (2005) 789-797. (Pubitemid 40391497)
6. K. C. Ying and C. J. Liao, Aa ant colony system for premutation flow-shop sequencing, Comput. Oper. Res. 31 (2004) 791-801.
7. A. A. E. Ahmed, L. T. Germano and Z. C. Antonio, A hybrid particle swarm optimization applied to loss power minimization, IEEE Trans. Power Syst. 20(2) (2005) 859-866.
8. J. Hazra and A. K. Sinha, Congestion management using multiobjective particle swarm optimization, IEEE Trans. Power Syst. 22(4) (2007) 1726-1734. (Pubitemid 350141972)
9. J. G. Vlachogiannis and K. Y. Lee, A comparative study on particle swarm optimization for optimal steady-state performance of power systems, IEEE Trans. Power Syst. 21(4) (2006) 1718-1728. (Pubitemid 46357772)
10. A. Chatterjee, K. Pulasinghe, K.Watanabe and K. Izumi, A particle-swarm-optimized fuzzy-neural network for voice-controlled robot systems, IEEE Trans. Ind. Electron. 52(6) (2005) 1478-1489. (Pubitemid 41830018)
11. C. F. Juang, A hybrid genetic algorithm and particle swarm optimization for recurrent network design, IEEE Trans. Syst. Man and Cybern. B 34(2) (2004) 997-1006.
12. Y. Song, Z. Chen and Z. Yuan, New chaotic PSO-based neural network predictive control for nonlinear process, IEEE Trans. Neural Networks 18(2) (2007) 595-601.
13. S. L. Ho, S. Y. Yang, G. Z. Ni and K. F. Wong, An improved PSO method with application to multimodal functions of inverse problems, IEEE Trans. Magnetics 4 (2007) 1597-1600. (Pubitemid 46495540)
14. R. Marinke, E. Araujo, Ld. S. Coelho and I. Matiko, Particle swarm optimization (PSO) applied to fuzzy modeling in a thernal-vacuum system, in Proc. 5th Int. Conf. Hybrid Intelligent Systems (Rio de Janeiro, Brazil, 2005), pp. 67-72.
15. Z. Lian, X. Gu and B. Jiao, A novel particel swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan, Chaos, Solitons and Fractals 35 (2008) 851-861. (Pubitemid 47562753)
16. B. Liu, L. Wang and Y. H. Jin, An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers, Comput. Oper. Res. 35 (2008) 2791-2806. (Pubitemid 351186803)
17. B. Liu, L. Wang and Y. H. Jin, An effective PSO-based memetic algorithm for flow shop scheduling, IEEE Trans. Syst. Man and Cybern. B 37 (2007) 18-27. (Pubitemid 46358476)
18. K. Sun and G. Yang, An effective hybrid optimization algorithm for the flow shop scheduling problem, Proc. 30th IEEE Conf. Decision and Control (New Orleans, USA, 1995) 1942-1948.
19. 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, Eur. J. Oper. Res. 177 (2007) 1930-1947. (Pubitemid 44780934)
20. L. Yuan and Z. D. Zhao, A modified binary particle swarm optimization algorithm for permutation flowshop problem, Proc. 6th Int. Conf. on Machine Learing and Cybernetics (Hong Kong, 2007), pp. 902-907.
21. J. Kennedy and R. Eberhart, Particle swarm optimization, Proceedings of IEEE International Conference on Neural Networks (Piscataway, NJ, 1995) 1942-1948.
22. J. Kennedy, R. Eberhart and Y. Shi, Swarm Intelligence (Morgan Kaufmann Publishers, San Fransisco, USA, 2001).
23. P. Angeline, Using selection to improve particle swarm optimization, Proc. IEEE Congress on Evolutionary Computing (Anchorage 1998), pp. 84-89.
24. M. M. Noel and T. C. Jannett, Simulation of a new hybrid particle swarm optimization algorithm, Proc. 36th Southeastern Symposium on System Theory (Atlanta, USA, 1994), pp. 150-153.
25. C. F. Juang, A hybrid genetic algorithm and particle swarm optimization for recurrent network design, IEEE Trans. Syst. Man and Cybern. B 34(2) (2004) 997-1006.
26. G. G. Yen and M. Daneshyari, Diversity-based information exchange among multiple swarms in particle swarm optimization, International Journal of Computational Intelligence and Applications 7(1) (2008) 57-75.
27. S. H. Ling, H. H. C. Iu, K. Y. Chan, H. K. Lam, C. W. Yeung and F. H. F. Leung, Hybrid particle swarm optimization with wavelet mutation and its industrial applications, IEEE Trans. Syst. Man and Cybern. B 38(3) (2008) 743-763. (Pubitemid 351796155)
28. S. H. Ling, H. H. C. Iu, F. H. F. Leung and K. Y. Chan, Improved hybrid PSO-based wavelet neural network for modelling the development of fluid dispensing for electronic packaging, IEEE Trans. Industrial Electronic 55(9) (2008) 3447-3460.
29. B. A. Norman and A. E. Smith, Random keys genetic algorithm with adaptive penalty function for optimization of constrained facility layout problems, Proc. IEEE Int. Conf. on Evolutionary Computation 1997 (1997) 407-411.
30. S. Xu and J. C. Bean, A genetic algorithm for scheduling parallel non-identical batch processing machines, Proc. IEEE Symposium on Computational Intelligence in Scheduling (Honolulu, Hawaii, 2007), pp. 143-150. (Pubitemid 47431194)
31. R. C. Eberhart and Y. Shi, Comparing inertia weights and constriction factors in particle swarm optimization, Proc. IEEE Congress on Evolutionary Computing (2000) 84-88.
32. Baker, Introduction to Sequencing and Scheduling (John Wiley and Sons, New York, 1974).
33. J. Carlier, Ordonnancements a contraintes disjonctives, R.A.I.R.O. Recherche Operationelle/ Oper. Res. 12(4) (1978) 333-351.
34. C. R. Reeves, A genetic algorithm for flowshop sequencing, Computers and Operations Research 22(1) (1995) 5-13.
35. H. Liu, L. Gao and Q. Pan, A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem, Journal Expert Systems with Applications 38(4) (2011) 4348-4360.
36. L. Wang and D. Z. Zheng, An effective hybrid heuristic for flow shop scheduling, Int. J. Adv. Manuf. Technol. 21(1) (2003) 38-44.
37. L. Bo, et al., An Effective PSO-Based Mimetic Algorithm for Flow Shop Scheduling, IEEE Transactions on Systems, Man, and Cybernetics, Part B 37 (2007) 18-27.