Genetic algorithm for the flexible job-shop scheduling problem

In this paper, we are interested in the multiobjective optimization of the schedule performance in the flexible job shops. The Flexible Job Shop Scheduling Problem (FJSP) is known in the literature as one of the hardest combinatorial optimization problems and presents many objectives to be optimized. In this way, we aim to solve such a problem according a set of some criteria which will be able to characterize the feasible solutions of such a problem. The studied criteria are the following: the makespan, the workload of the critical machine, and the total workload of all the machines. Our study relates to the determination of a practical method using genetic algorithm in order to obtain the best performance of the production system. The solution performance is evaluated by comparing the values of the different values of the criteria with the corresponding lower bounds.