Scheduling Flexible Job-Shops: A Worst Case Analysis And An Evolutionary Algorithm

In this paper, we deal with the flexible job shop scheduling problem. We propose an efficient heuristic method for solving the assignment problem. Indeed, we propose a worst case analysis to evaluate the performance of such a heuristic. The second specificity of the problem studied is the sequencing property. Our approach consists in the application of an evolutionary algorithm based on a set of adapted operators to solve the sequencing step. Some lower bounds for the problem (previously proposed in Ref. 1) will be used in order to evaluate the quality of our method and the solutions according to the different criteria.

[1]  J. Carlier.  The one-machine sequencing problem , 1982 .

[2]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

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

[4]  Bernd Jurisch,et al.  Scheduling jobs in shops with multi-purpose machines , 1992 .

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

[6]  Khaled Mesghouni.  Application des algorithmes évolutionnistes dans les problèmes d'optimisation en ordonnancement de la production , 1999 .

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

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

[9]  C. Chu.  A branch-and-bound algorithm to minimize total tardiness with different release dates , 1992 .

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

[11]  Hussein A. Abbass,et al.  Solving Two Multi-Objective Optimization Problems Using Evolutionary Algorithm , 2003 .

[12]  Stéphane Dauzère-Pérès,et al.  Multi-resource shop scheduling with resource flexibility , 1998, Eur. J. Oper. Res..

[13]  Imed Kacem,et al.  Ordonnancement multicritère des job-shops flexibles : formulation, bornes inférieures et approche évolutionniste coopérative , 2003 .

[14]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[15]  M.-C. Portmann,et al.  Les algorithmes génétiques et leur application aux problèmes d'ordonnancement , 1995 .

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

[17]  Jacques Carlier,et al.  Scheduling jobs with release dates and tails on identical machines to minimize the makespan , 1987 .