Multi-objective swarm-based neighborhood search for fuzzy flexible job shop scheduling

This paper considered fuzzy flexible job scheduling problems with makespan and maximum machine workload and proposed a multi-objective swarm-based neighborhood search (MOSNS). In MOSNS, ordered operation-based doublet string and three-dimension array are used to indicate the solution of two subproblems, two swaps and an insertion are applied to produce new solutions, simple weighted objective-based methods are used to update swarm and external archive to obtain a set of nondominated solutions. Some numerical experiments are conducted by using some instances and computational results show that MOSNS performs better than the existing methods from literature.

[1]  Jorge Puente,et al.  A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty , 2010, J. Intell. Manuf..

[2]  Demion Lei.  Scheduling fuzzy job shop with preventive maintenance through swarm-based neighborhood search , 2011 .

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

[4]  Christoph S. Thomalla.  Job shop scheduling with alternative process plans , 2001 .

[5]  Deming Lei.  Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems , 2008 .

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

[7]  Minghao Yin,et al.  A novel objective function for job-shop scheduling problem with fuzzy processing time and fuzzy due date using differential evolution algorithm , 2011 .

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

[9]  Masatoshi Sakawa,et al.  Fuzzy programming for multiobjective job shop scheduling with fuzzy processing time and fuzzy duedate through genetic algorithms , 2000, Eur. J. Oper. Res..

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

[11]  Deming Lei,et al.  Fuzzy job shop scheduling problem with availability constraints , 2010, Comput. Ind. Eng..

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

[13]  De-Ming Lei,et al.  Solving fuzzy flexible job shop scheduling problems using genetic algorithm , 2008, 2008 International Conference on Machine Learning and Cybernetics.

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

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

[16]  Lothar Thiele,et al.  Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach , 1999, IEEE Trans. Evol. Comput..

[17]  Ajith Abraham,et al.  A Multi-swarm Approach to Multi-objective Flexible Job-shop Scheduling Problems , 2009, Fundam. Informaticae.

[18]  Deming Lei,et al.  A genetic algorithm for flexible job shop scheduling with fuzzy processing time , 2010 .

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

[20]  Taïcir Loukil,et al.  A multi-objective production scheduling case study solved by simulated annealing , 2007, Eur. J. Oper. Res..

[21]  Nhu Binh Ho,et al.  Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems , 2008, Comput. Ind. Eng..

[22]  M. Sakawa,et al.  An efficient genetic algorithm for job-shop scheduling problems with fuzzy processing time and fuzzy duedate , 1999 .

[23]  Mitsuo Gen,et al.  A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems , 2007, Comput. Ind. Eng..

[24]  Adil Baykasoğlu,et al.  Linguistic-based meta-heuristic optimization model for flexible job shop scheduling , 2002 .