ABACTERIAL EVOLUTIONARY ALGORITHM FOR THE JOB SHOP SCHEDULING PROBLEM

ABSTRACT The job-shop scheduling problem is one of the most complicated and well-known hardest combinatorial optimization problems. It's purpose is to improve the production efficiency and reduce the processing duration so as to gain profits as high as possible. In addition, it has been illustrated that job-shop scheduling is usually an NP-hard combinatorial problem and is therefore unlikely to be solvable in polynomial time. In this study, a bacterial evolutionary algorithm is proposed for finding multiple optimal solutions to the job-shop scheduling problem. Bacterial evolutionary algorithm is an optimization method that incorporates special mechanisms inspired by natural phenomena of microbial evolution. Gene transfer and bacterial mutation operators are incorporated to improve the performance of the proposed method. Moreover, niche scheme is employed to discover multiple solutions. Numerous well-studied benchmark examples were utilized to evaluate the effectiveness of the proposed approach.

[1]  Peter Brucker,et al.  Sequencing and scheduling , 2003, Eur. J. Oper. Res..

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

[3]  T. Furuhashi,et al.  A study on fuzzy rules discovery using Pseudo-Bacterial Genetic Algorithm with adaptive operator , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[4]  Latif Al-Hakim,et al.  An analogue genetic algorithm for solving job shop scheduling problems , 2001 .

[5]  Mitsuo Gen,et al.  Solving job-shop scheduling problems by genetic algorithm , 1994, Proceedings of IEEE International Conference on Systems, Man and Cybernetics.

[6]  Takeshi Furuhashi,et al.  Fuzzy system parameters discovery by bacterial evolutionary algorithm , 1999, IEEE Trans. Fuzzy Syst..

[7]  Gu Qingming,et al.  A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEDULING PROBLEM , 1998 .

[8]  J. L. Martínez.  Do bacteria have sex? , 1991, Nature.

[9]  梁炜,et al.  Neural network and genetic algorithm-based hybrid approach to expanded job-shop scheduling , 2001 .

[10]  Wenjia Wang,et al.  An effective genetic algorithm for job shop scheduling , 2000 .

[11]  P. Aravindan,et al.  A Tabu Search Algorithm for Job Shop Scheduling , 2000 .

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

[13]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

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

[15]  Carlos A. Coello Coello,et al.  Use of an Artificial Immune System for Job Shop Scheduling , 2003, ICARIS.

[16]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[17]  Ling Wang,et al.  A Modified Genetic Algorithm for Job Shop Scheduling , 2002 .

[18]  C.K. Wong,et al.  Two simulated annealing-based heuristics for the job shop scheduling problem , 1999, Eur. J. Oper. Res..

[19]  Shengxiang Yang,et al.  A new adaptive neural network and heuristics hybrid approach for job-shop scheduling , 2001, Comput. Oper. Res..

[20]  Jan Karel Lenstra,et al.  Sequencing and scheduling : an annotated bibliography , 1997 .

[21]  Cheol Hoon Park,et al.  Genetic algorithm for job shop scheduling problems based on two representational schemes , 1995 .

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

[23]  Kevin M. Passino,et al.  Biomimicry of bacterial foraging for distributed optimization and control , 2002 .

[24]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.