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

Abstract This paper proposes a Pareto-based grouping discrete harmony search algorithm (PGDHS) to solve the multi-objective flexible job shop scheduling problem (FJSP). Two objectives, namely the maximum completion time (makespan) and the mean of earliness and tardiness, are considered simultaneously. Firstly, two novel heuristics and several existing heuristics are employed to initialize the harmony memory. Secondly, multiple harmony generation strategies are proposed to improve the performance of harmony search algorithm. The operation sequence in a new harmony is produced based on the encoding method and the characteristics of FJSP. Thirdly, two local search methods based on critical path and due date are embedded to enhance the exploitation capability. Finally, extensive computational experiments are carried out using well-known benchmark instances. Three widely used performance measures, number of non-dominated solutions, diversification metric and quality metric, are employed to test the performance of PGDHS algorithm. Computational results and comparisons show the efficiency and effectiveness of the proposed PGDHS algorithm for solving multi-objective flexible job-shop scheduling problem.

[1]  Jing J. Liang,et al.  A local-best harmony search algorithm with dynamic sub-harmony memories for lot-streaming flow shop scheduling problem , 2011, Expert Syst. Appl..

[2]  Mehmet Fatih Tasgetiren,et al.  Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..

[3]  Ali R. Yildiz,et al.  A new hybrid differential evolution algorithm for the selection of optimal machining parameters in milling operations , 2013, Appl. Soft Comput..

[4]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[5]  Mahamed G. H. Omran,et al.  Global-best harmony search , 2008, Appl. Math. Comput..

[6]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[7]  Quan-Ke Pan,et al.  An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems , 2010, Comput. Ind. Eng..

[8]  Li-Ning Xing,et al.  Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling , 2009, Appl. Soft Comput..

[9]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[10]  G. Moslehi,et al.  A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search , 2011 .

[11]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[12]  DebK.,et al.  A fast and elitist multiobjective genetic algorithm , 2002 .

[13]  Ali R. Yildiz,et al.  A comparative study of population-based optimization algorithms for turning operations , 2012, Information Sciences.

[14]  Seyed Habib A. Rahmati.  Proposing a Pareto-based Multi-Objective Evolutionary Algorithm to Flexible Job Shop Scheduling Problem , 2012 .

[15]  Jing J. Liang,et al.  Dynamic multi-swarm particle swarm optimizer , 2005, Proceedings 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005..

[16]  Quan-Ke Pan,et al.  An effective shuffled frog-leaping algorithm for multi-objective flexible job shop scheduling problems , 2012, Appl. Math. Comput..

[17]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[18]  Liang Gao,et al.  An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem , 2009, Comput. Ind. Eng..

[19]  Qingfu Zhang,et al.  Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II , 2009, IEEE Transactions on Evolutionary Computation.

[20]  Jing J. Liang,et al.  A Hybrid Harmony Search Algorithm for the no-Wait Flow-shop Scheduling Problems , 2012, Asia Pac. J. Oper. Res..

[21]  Mostafa Zandieh,et al.  Bi-objective partial flexible job shop scheduling problem: NSGA-II, NRGA, MOGA and PAES approaches , 2012 .

[22]  Ali R. Yildiz,et al.  Cuckoo search algorithm for the selection of optimal machining parameters in milling operations , 2013 .

[23]  Zuobao Wu,et al.  Multiagent scheduling method with earliness and tardiness objectives in flexible job shops , 2005, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[24]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[25]  Zong Woo Geem,et al.  Optimal Scheduling of Multiple Dam System Using Harmony Search Algorithm , 2007, IWANN.

[26]  Liang Gao,et al.  An effective genetic algorithm for the flexible job-shop scheduling problem , 2011, Expert Syst. Appl..

[27]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[28]  Ling Wang,et al.  A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem , 2013 .

[29]  G. Vilcot,et al.  A tabu search algorithm for solving a multicriteria flexible job shop scheduling problem , 2011 .

[30]  Mostafa Zandieh,et al.  Integrating simulation and genetic algorithm to schedule a dynamic flexible job shop , 2009, J. Intell. Manuf..

[31]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[32]  Parviz Fattahi,et al.  A HYBRID MULTI OBJECTIVE ALGORITHM FOR FLEXIBLE JOB SHOP SCHEDULING , 2009 .

[33]  X. Shao,et al.  A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem , 2010 .

[34]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..

[35]  Bijaya K. Panigrahi,et al.  Exploratory Power of the Harmony Search Algorithm: Analysis and Improvements for Global Numerical Optimization , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[36]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[37]  Li-Ning Xing,et al.  An efficient search method for multi-objective flexible job shop scheduling problems , 2009, J. Intell. Manuf..

[38]  Min Liu,et al.  An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling , 2012 .

[39]  M. Fesanghary,et al.  An improved harmony search algorithm for solving optimization problems , 2007, Appl. Math. Comput..

[40]  K. Lee,et al.  The harmony search heuristic algorithm for discrete structural optimization , 2005 .

[41]  Quan-Ke Pan,et al.  Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems , 2011 .

[42]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[43]  Vinícius Amaral Armentano,et al.  Tardiness minimization in a flexible job shop: A tabu search approach , 2004, J. Intell. Manuf..

[44]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[45]  Ponnuthurai N. Suganthan,et al.  Pareto-based discrete harmony search algorithm for flexible job shop scheduling , 2012, 2012 12th International Conference on Intelligent Systems Design and Applications (ISDA).

[46]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for the no-wait flow shop scheduling problem with total flow time criterion , 2011 .

[47]  Ponnuthurai N. Suganthan,et al.  Multi-objective optimization using self-adaptive differential evolution algorithm , 2009, 2009 IEEE Congress on Evolutionary Computation.

[48]  Qingfu Zhang,et al.  Decomposition-Based Multiobjective Evolutionary Algorithm With an Ensemble of Neighborhood Sizes , 2012, IEEE Transactions on Evolutionary Computation.

[49]  Ali R. Yildiz,et al.  Hybrid Taguchi-differential evolution algorithm for optimization of multi-pass turning operations , 2013, Appl. Soft Comput..

[50]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..