Pareto-based grouping discrete harmony search algorithm for multi-objective flexible job shop scheduling

Information Sciences

Volumn 289, Issue 1, 2014, Pages 76-90

  Gao, K Z ^a,b   Suganthan, P N ^a   Pan, Q K ^b   Chua, T J ^c   Cai, T X ^c   Chong, C S ^c  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b LIAOCHENG UNIVERSITY   (China)

^c SINGAPORE INSTITUTE OF MANUFACTURING TECHNOLOGY   (Singapore)

Author keywords

Flexible job shop scheduling; Harmony search algorithm; Local search; Multi objective optimization

Indexed keywords

BENCHMARKING; COMPUTATIONAL EFFICIENCY; LEARNING ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); MULTIOBJECTIVE OPTIMIZATION; SCHEDULING;

COMPUTATIONAL EXPERIMENT; DISCRETE HARMONY SEARCHES; EARLINESS AND TARDINESS; FLEXIBLE JOB-SHOP SCHEDULING; FLEXIBLE JOB-SHOP SCHEDULING PROBLEM; HARMONY SEARCH ALGORITHMS; LOCAL SEARCH; MAXIMUM COMPLETION TIME;

JOB SHOP SCHEDULING;

EID: 84948614402     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2014.07.039     Document Type: Article

References (49)

1. P. Brandimarte, Routing and scheduling in a flexible job shop by tabu search, Ann. Oper. Res. 41 (1993) 157-183.
2. P. Brucker, R. Schlie, Job-shop scheduling with multi-purpose machines, Computing 45 (1990) 369-375.
3. S. Das, A. Mukhopadhyay, A. Roy, A. Abraham, B.K.R. Panigrahi, Exploratory power of the harmony search algorithm: analysis and improvements for global numerical optimization, IEEE Trans. Syst., Man, Cybern., B: Cybern. 41 (2011) 89-106.
4. K. Deb, A. Pratap, S. Agarwal, T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evol. Comput. 6 (2002) 182-197.
5. P. Fattahi, A hybrid multi objective algorithm for flexible job shop scheduling, Int. J. Math. Stat. Sci. 1 (2009) 21-26.
6. J. Gao, L. Sun, M. Gen, A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, Comput. Oper. Res. 35 (2008) 2892-2907.
7. K.Z. Gao, Q.K. Pan, J.Q. Li, Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion, Int. J. Adv. Manuf. Technol. 56 (2011) 683-692.
8. K.Z. Gao, Q.K. Pan, J.Q. Li, J.J. Liang, A hybrid harmony search algorithm for the no-wait flow shop scheduling problems, Asia-Pac. J. Oper. Res. 29 (2012) 1250012 1-1250012 23.
9. K.Z. Gao, P.N. Suganthan, T.J. Chua, Pareto-based discrete harmony search algorithm for flexible job shop scheduling, in: Proc. 12th Int. Conf. Intelligent System Design and Applications, ISDA'12, Kochi, India, 2012, pp. 953-956.
10. M.R. Garey, D.S. Johnson, R. Sethi, The complexity of flow hop and job shop scheduling, Math. Oper. Res. 1 (1976) 117-129.
11. Z.W. Geem, J.H. Kim, G.V. Loganathan, A new heuristic optimization algorithm: harmony search, Simulation 76 (2001) 60-68.
12. Z.W. Geem, Optimal scheduling of multiple dam system using harmony search algorithm, Lect. Notes Comput. Sci. 4507 (2007) 316-323.
13. M. Gholami, M. Zandieh, Integrating simulation and genetic algorithm to scheduling a dynamic flexible job shop, J. Intell. Manuf. 20 (2009) 481-498.
14. V.L. Huang, S.Z. Zhao, R, Mallipeddi, P.N. Suganthan, Multi-objective optimization using self-adaptive differential evolution algorithm, in: Proc. of 2009 IEEE Congress on Evolutionary Computation, IEEE CEC'09, Trondheim, Norway, 2009, pp. 190-194.
15. A.S. Jain, S. Meeran, Deterministic job-shop scheduling: past, present and future, Eur. J. Oper. Res. 113 (1998) 390-434.
16. I. Kacem, S. Hammadi, P. Borne, Approach by localization and multi-objective evolutionary optimization for flexible job shop scheduling problems, IEEE Trans. Syst., Man, Cybern. 32 (2002) 1-13.
17. I. Kacem, S. Hammadi, P. Borne, Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic, Math. Comput. Simulat. 60 (2002) 245-276.
18. K.S. Lee, Z.W. Geem, S.H. Lee, K.W. Bae, The harmony search heuristic algorithm for discrete structural optimization, Eng. Optimize. 37 (2005) 663-684.
19. H. Li, Q. Zhang, Multiobjective optimization problem with complicated Pareto sets, MOEA/D and NSGA-II, IEEE Trans. Evol. Comput. 13 (2009) 284-302.
20. J.Q. Li, Q.K. Pan, Y.C. Liang, An effective hybrid tabu search algorithm for multi-objective flexible job shop scheduling problems, Comput. Ind. Eng. 59 (2010) 647-662.
21. J.Q. Li, Q.K. Pan, K.Z. Gao, Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems, Int. J. Adv. Manuf. Technol. 55 (2011) 1159-1169.
22. J.Q. Li, Q.K. Pan, S.X. Xie, An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems, Appl. Math. Comput. 218 (2012) 9353-9375.
23. J.J. Liang, P.N. Suganthan, Dynamic multi-swarm particle swarm optimizer, in: Proc. 2005 IEEE Conf. Swarm Intelligence Symposium, SIS'05, Pasadena, California, USA, 2005, pp. 124-129.
24. M. Mahdavi, M. Fesanghary, E. Damangir, An improved harmony search algorithm for solving optimization problems, Appl. Math. Comput. 188 (2007) 1567-1579.
25. G. Moslehi, M. Mahnam, A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search, Int. J. Prod. Econ. 129 (2011) 14-22.
26. M.G.H. Omran, M. Mahdavi, Global-best harmony search, Appl. Math. Comput. 198 (2008) 643-656.
27. Q.K. Pan, P.N. Suganthan, J.J. Liang, M.F. Tasgetiren, A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem, Expert Syst. Appl. 38 (2011) 3252-3259.
28. F. Pezzella, G. Morganti, G. Ciaschetti, A genetic algorithm for the flexible job-shop scheduling problem, Comput. Oper. Res. 35 (2008) 3202-3212.
29. M. Pinedo, Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood Cliff, New Jersey, 2002.
30. M. Rabiee, M. Zandieh, P. Ramezani, Bi-objective partial flexible job shop scheduling problems: NSGA-II, NRGA, MOGA and PAES approaches, Int. J. Prod. Res. 50 (2012) 7327-7342.
31. Seyed Habib A. Rahmati, Proposing a Pareto-based Multi-objective evolutionary algorithm to flexible job shop scheduling problem, World Acad. Sci., Eng. Technol. 61 (2012) 1160-1165.
32. C.R. Scrich, V.A. Armentano, M. Laguna, Tardiness minimization in a flexible job shop: a tabu search approach, J. Intell. Manuf. 15 (2004) 103-115.
33. G. Vilcot, J.C. Billaut, A tabu search algorithm for solving a multi-criteria flexible job shop scheduling problem, Int. J. Prod. Res. 49 (2011) 6963-6980.
34. L. Wang, G. Zhou, Y. Xu, M. Liu, An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job shop scheduling, Int. J. Adv. Manuf. Technol. 60 (2012) 1111-1123.
35. L. Wang, Q.K. Pan, M.F. Tasgetiren, Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms, Expert Syst. Appl. 37 (2010) 7929-7936.
36. Ling. Wang, Shengyao. Wang, Min. Liu, A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem, Int. J. Prod. Res. 51 (2013) 3574-3592.
37. X. Wang, L. Gao, G. Zhang, X. Shao, A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem, Int. J. Adv. Manuf. Technol. 51 (2010) 757-767.
38. Z.B. Wu, M.X. Weng, Multi-agent scheduling method with earliness and tardiness objectives in flexible job shops, IEEE Trans. Syst., Man, Cybern. - B: Cybern. 35 (2005) 293-301.
39. W.J. Xia, Z.M. Wu, An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems, Comput. Ind. Eng. 48 (2005) 409-425.
40. L.N. Xing, Y.W. Chen, K.W. Yang, Multi-objective flexible job shop schedule: design and evaluation by simulation modeling, Appl. Soft Comput. 9 (2009) 362-376.
41. L.N. Xing, Y.W. Chen, K.W. Yang, An efficient search method for multi-objective flexible job shop scheduling problems, J. Intell. Manuf. 20 (2009) 283-293.
42. Ali R. Yildiz, A comparative study of population-based optimization algorithms for turning operations, Inform. Sci. 210 (2012) 81-88.
43. R. Ali Yildiz, Hybrid Taguchi-differential evolution algorithm for optimization of multi-pass turning operations, Appl. Soft Comput. 13 (2013) 1433-1439.
44. R. Ali Yildiz, A new hybrid differential evolution algorithm for the selection of optimal machining parameters in milling operations, Appl. Soft Comput. 13 (2013) 1561-1566.
45. R. Ali Yildiz, Cuckoo search algorithm for the selection of optimal machining parameters in milling operations, Int. J. Adv. Manuf. Technol. 64 (2013) 55-61.
46. G.H. Zhang, X.Y. Shao, P.G. Li, L. Gao, An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem, Comput. Ind. Eng. 56 (2009) 1309-1318.
47. G.H. Zhang, L. Gao, Y. Shi, An effective genetic algorithm for the flexible job-shop scheduling problem, Expert Syst. Appl. 38 (2011) 3563-3573.
48. C.Y. Zhang, P.G. Li, Z.L. Guan, Y.Q. Rao, A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem, Comput. Oper. Res. 34 (2007) 3229-3242.
49. S. Zhao, P.N. Suganthan, Q. Zhang, Decomposition-based multi-objective evolutionary algorithm with an ensemble of neighborhood sizes, IEEE Trans. Evol. Comput. 16 (2012) 442-446.