A modified genetic algorithm with fuzzy roulette wheel selection for job-shop scheduling problems

The job-shop scheduling problem is one of the most difficult production planning problems. Since it is in the NP-hard class, a recent trend in solving the job-shop scheduling problem is shifting towards the use of heuristic and metaheuristic algorithms. This paper proposes a novel metaheuristic algorithm, which is a modification of the genetic algorithm. This proposed algorithm introduces two new concepts to the standard genetic algorithm: (1) fuzzy roulette wheel selection and (2) the mutation operation with tabu list. The proposed algorithm has been evaluated and compared with several state-of-the-art algorithms in the literature. The experimental results on 53 JSSPs show that the proposed algorithm is very effective in solving the combinatorial optimization problems. It outperforms all state-of-the-art algorithms on all benchmark problems in terms of the ability to achieve the optimal solution and the computational time.

[1]  Dazhi Wang,et al.  A constraint programming-based branch and bound algorithm for job shop problems , 2010, 2010 Chinese Control and Decision Conference.

[2]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[3]  Haibo Hu,et al.  An Effective Hybrid Genetic Algorithm for Job Shop Scheduling Problem , 2011 .

[4]  Chengbin Chu,et al.  An improvement of the Lagrangean relaxation approach for job shop scheduling: a dynamic programming method , 1998, IEEE Trans. Robotics Autom..

[5]  Kamran Zamanifar,et al.  An agent-based parallel approach for the job shop scheduling problem with genetic algorithms , 2010, Math. Comput. Model..

[6]  R. Tavakkoli-Moghaddam,et al.  A hybrid algorithm based on particle swarm optimization and simulated annealing for a periodic job shop scheduling problem , 2011 .

[7]  John E. Beasley,et al.  OR-Library: Distributing Test Problems by Electronic Mail , 1990 .

[8]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[9]  Mohamed Haouari,et al.  A branch-and-bound-based local search method for the flow shop problem , 2003, J. Oper. Res. Soc..

[10]  Shousheng Zhang.  A tabu search algorithm based on quasi-physics and quasi-human for solving the job shop scheduling problem , 2010, 2010 Second IITA International Conference on Geoscience and Remote Sensing.

[11]  OPTIMAL SCHEDULING USING CONSTRAINT LOGIC PROGRAMMING , .

[12]  G. Nallakumarasamy,et al.  A Hybrid Bubble Sorting Simulated Annealing algorithm for job shop scheduling , 2012, 2012 Third International Conference on Computing, Communication and Networking Technologies (ICCCNT'12).

[13]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[14]  S. Binato,et al.  A GRASP FOR JOB SHOP SCHEDULING , 2001 .

[15]  Yanchun Liang,et al.  An Effective PSO and AIS-Based Hybrid Intelligent Algorithm for Job-Shop Scheduling , 2008, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[16]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[17]  Mitsuo Gen,et al.  Network Models and Optimization: Multiobjective Genetic Algorithm Approach , 2008 .

[18]  Ziad Kobti,et al.  A Machine Operation Lists based Memetic Algorithm for Job Shop Scheduling , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[19]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[20]  Robert LIN,et al.  NOTE ON FUZZY SETS , 2014 .

[21]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[22]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[23]  Francisco Saldanha-da-Gama,et al.  Solving the job-shop scheduling problem optimally by dynamic programming , 2012, Comput. Oper. Res..

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

[25]  W. Banzhaf,et al.  The “molecular” traveling salesman , 1990, Biological Cybernetics.

[26]  Liang Gao,et al.  An efficient memetic algorithm for solving the job shop scheduling problem , 2011, Comput. Ind. Eng..

[27]  Yanchun Liang,et al.  Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems , 2008 .

[28]  Peter Brucker,et al.  A Branch and Bound Algorithm for the Job-Shop Scheduling Problem , 1994, Discret. Appl. Math..

[29]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .