Optimization by phases for the flexible job-shop scheduling problem

In this paper, we deal with the flexible job shop scheduling problem. The suggested method is based on an optimization by phases. The first phase is ensured by an assignment technique based on a heuristic approach and local search. The second phase consists in applying a genetic algorithm to deal with the sequencing problem. The approach performance is evaluated by using a set of lower bounds. Such lower bounds are based on the relaxation of some constraints like the disjunctive constraint on the resources. The preliminary experimental results are satisfactory and promising.