SOLVING FLEXIBLE JOB SHOP SCHEDULING WITH MULTI OBJECTIVE APPROACH

In this paper flexible job-shop scheduling problem (FJSP) is studied in the case of optimizing different contradictory objectives consisting of: (1) minimizing makespan, (2) minimizing total workload, and (3) minimizing workload of the most loaded machine. As the problem belongs to the class of NP-Hard problems, a new hybrid genetic algorithm is proposed to obtain a large set of Paretooptimal solutions in a reasonable run time. The algorithm utilizes from a local search heuristic for improving the chance of obtaining more number of global Pareto-optimal solutions. The solution method uses from a perturbed global criterion function for guiding the search direction of the hybrid algorithm. Computational experiences show that the hybrid algorithm has superior performance in contrast to previous studies.

[1]  Kaisa Miettinen.  No-Preference Methods , 1998 .

[2]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[3]  Jasbir S. Arora,et al.  Introduction to Optimum Design , 1988 .

[4]  Chinyao Low,et al.  Modelling and heuristics of FMS scheduling with multiple objectives , 2006, Comput. Oper. Res..

[5]  Luca Maria Gambardella,et al.  Effective Neighborhood Functions for the Flexible Job Shop Problem , 1998 .

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

[7]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[8]  Wu Xiao-dan.  Solution to flexible Job Shop scheduling problems with capacitated constraints based on ant colony & genetic algorithms , 2007 .

[9]  Lale Özbakir,et al.  Using multiple objective tabu search and grammars to model and solve multi-objective flexible job shop scheduling problems , 2004, J. Intell. Manuf..

[10]  Johann L. Hurink,et al.  Tabu search for the job-shop scheduling problem with multi-purpose machines , 1994 .

[11]  Jan Paulli,et al.  A hierarchical approach for the FMS scheduling problem , 1995 .

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

[13]  Fariborz Jolai,et al.  Mathematical modeling and heuristic approaches to flexible job shop scheduling problems , 2007, J. Intell. Manuf..

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

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

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

[17]  Mohammad Saidi-Mehrabad,et al.  Flexible job shop scheduling with tabu search algorithms , 2007 .

[18]  Michael N. Vrahatis,et al.  Recent approaches to global optimization problems through Particle Swarm Optimization , 2002, Natural Computing.

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

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

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

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

[23]  Mitsuo Gen,et al.  Multistage-Based Genetic Algorithm for Flexible Job-Shop Scheduling Problem , 2009 .

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

[25]  Baoding Liu,et al.  Theory and Practice of Uncertain Programming , 2003, Studies in Fuzziness and Soft Computing.