A Hybrid Pareto-Based Tabu Search for Multi-objective Flexible Job Shop Scheduling Problem with E/T Penalty

In this paper, we propose a Pareto-based tabu search algorithm for multi-objective FJSP with Earliness/Tardiness (E/T) penalty In the hybrid algorithm, several neighboring structure based approaches were proposed to improve the convergence capability of the algorithm while keep population diversity of the last Pareto archive set In addition, an external Pareto archive was developed to record the non-dominated solutions found so far In the hybrid algorithm, dynamic parameters were introduced to adapt to the searching process Experimental on several well-known benchmark instances show that the proposed algorithm is superior to several existing approaches in both solution quality and convergence ability.

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

[2]  Chengbin Chu,et al.  Minimizing total tardiness on a single machine with sequence-dependent setup times , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[3]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[4]  Quan-Ke Pan,et al.  A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems , 2009, Comput. Oper. Res..

[5]  Vinicius Amaral Armentano,et al.  Tabu search for minimizing total tardiness in a job shop , 2000 .

[6]  F. Pezzella,et al.  A genetic algorithm for the Flexible Job-shop Scheduling Problem , 2008, Comput. Oper. Res..

[7]  Jack C. Hayya,et al.  Priority dispatching with operation due dates in a job shop , 1982 .

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

[9]  C. Chu A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

[10]  Nhu Binh Solving Multiple-Objective Flexible Job Shop Problems by Evolution and Local Search , 2008 .

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

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

[13]  Pierre Borne,et al.  Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production , 2007, Int. J. Comput. Commun. Control.

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

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

[16]  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.

[17]  Quan-ke Pan,et al.  An effective hybrid particle swarm optimization algorithm for flexible job-shop scheduling problem , 2008 .

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