A genetic algorithm for the Flexible Job-shop Scheduling Problem

In this paper, we present a genetic algorithm for the Flexible Job-shop Scheduling Problem (FJSP). The algorithm integrates different strategies for generating the initial population, selecting the individuals for reproduction and reproducing new individuals. Computational result shows that the integration of more strategies in a genetic framework leads to better results, with respect to other genetic algorithms. Moreover, results are quite comparable to those obtained by the best-known algorithm, based on tabu search. These two results, together with the flexibility of genetic paradigm, prove that genetic algorithms are effective for solving FJSP.

[1]  Andrew Y. C. Nee,et al.  A modified genetic algorithm for distributed scheduling problems , 2003, J. Intell. Manuf..

[2]  Christian Scheideler,et al.  Improved Bounds for Acyclic Job Shop Scheduling , 2002, Comb..

[3]  Stéphane Dauzère-Pérès,et al.  An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search , 1997, Ann. Oper. Res..

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

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

[6]  Klaus Jansen,et al.  Approximation algorithms for flexible job shop problems , 2000, Int. J. Found. Comput. Sci..

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

[8]  Christian Scheideler,et al.  Improved bounds for acyclic job shop scheduling (extended abstract) , 1998, STOC '98.

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

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

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

[12]  Haoxun Chen,et al.  A genetic algorithm for flexible job-shop scheduling , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[13]  Nhu Binh Ho,et al.  GENACE: an efficient cultural algorithm for solving the flexible job-shop problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[14]  Joc Cing Tay,et al.  An Effective Chromosome Representation for Evolving Flexible Job Shop Schedules , 2004, GECCO.

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

[16]  Kyung Mi Lee,et al.  A genetic algorithm for general machine scheduling problems , 1998, 1998 Second International Conference. Knowledge-Based Intelligent Electronic Systems. Proceedings KES'98 (Cat. No.98EX111).