Solving Industrial Based Job-Shop Scheduling Problem by Distributed Micro-Genetic Algorithm with Local Search

Genetic algorithms (GAs) have been found to be suitable for solving Job-Shop Scheduling Problem (JSSP). However, convergence in GAs is rather slow and thus new GA structures and techniques are currently widely investigated. In this paper, we propose to solve JSSP using distributed micro-genetic algorithm (micro-GA) with local search based on the Asynchronous Colony Genetic Algorithms (ACGA). We also developed a representation for the problem in order to refine the schedules using schedule builder which can change a semi-active schedule to active schedule. The proposed technique is applied to Muth and Thompson's 10×10 and 20×5 problems as well as a real world JSSP. The results show that the distributed micro GA is able to give a good optimal makespan in a short time as compared to the manual schedule built for the real world JSSP.

[1]  Erwin Pesch,et al.  Evolution based learning in a job shop scheduling environment , 1995, Comput. Oper. Res..

[2]  C. Bierwirth A generalized permutation approach to job shop scheduling with genetic algorithms , 1995 .

[3]  Kalmanje Krishnakumar,et al.  Micro-Genetic Algorithms For Stationary And Non-Stationary Function Optimization , 1990, Other Conferences.

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

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

[6]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[7]  Mingyuan Chen,et al.  A Coarse-Grain Parallel Genetic Algorithm for Flexible Job-Shop Scheduling with Lot Streaming , 2009, 2009 International Conference on Computational Science and Engineering.

[8]  Y Takeshi,et al.  GENETIC ALGORITHMS FOR JOB-SHOP SCHEDULING PROBLEMS , 1997 .

[9]  Varghese S. Jacob,et al.  A genetics-based hybrid scheduler for generating static schedules in flexible manufacturing contexts , 1993, IEEE Trans. Syst. Man Cybern..

[10]  Isao Ono,et al.  An Efficient Genetic Algorithm for Job Shop Scheduling Problems , 1995, International Conference on Genetic Algorithms.

[11]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

[12]  Ran Chen,et al.  Research on Coarse-grained Parallel Genetic Algorithm Based Grid Job Scheduling , 2008, 2008 Fourth International Conference on Semantics, Knowledge and Grid.

[13]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[14]  Haruki Inoue,et al.  Development of artificial life based optimization system , 2001, Proceedings. Eighth International Conference on Parallel and Distributed Systems. ICPADS 2001.

[15]  Bernd Freisleben,et al.  A Genetic Local Search Approach to the Quadratic Assignment Problem , 1997, ICGA.

[16]  Hyung Rim Choi,et al.  A hybrid genetic algorithm for the job shop scheduling problems , 2003, Comput. Ind. Eng..