A Bee Evolutionary Guiding Nondominated Sorting Genetic Algorithm II for Multiobjective Flexible Job-Shop Scheduling

الملخص EN

Flexible job-shop scheduling problem (FJSP) is an NP-hard puzzle which inherits the job-shop scheduling problem (JSP) characteristics.

This paper presents a bee evolutionary guiding nondominated sorting genetic algorithm II (BEG-NSGA-II) for multiobjective FJSP (MO-FJSP) with the objectives to minimize the maximal completion time, the workload of the most loaded machine, and the total workload of all machines.

It adopts a two-stage optimization mechanism during the optimizing process.

In the first stage, the NSGA-II algorithm with T iteration times is first used to obtain the initial population N, in which a bee evolutionary guiding scheme is presented to exploit the solution space extensively.

In the second stage, the NSGA-II algorithm with GEN iteration times is used again to obtain the Pareto-optimal solutions.

In order to enhance the searching ability and avoid the premature convergence, an updating mechanism is employed in this stage.

More specifically, its population consists of three parts, and each of them changes with the iteration times.

What is more, numerical simulations are carried out which are based on some published benchmark instances.

Finally, the effectiveness of the proposed BEG-NSGA-II algorithm is shown by comparing the experimental results and the results of some well-known algorithms already existed.