Constrained stable matching strategy-based flexible job-shop scheduling method

摘要

A constrained stable matching strategy-based flexible job-shop scheduling method, belonging to the field of job-shop scheduling. The design solution of said method comprises: a . generating an initial chromosome population by means of integer coding, and initializing relevant parameters; b. performing crossover and mutation on parent chromosomes, so as to obtain child chromosomes; c . grouping the child chromosomes and the parent chromosomes into a set of chromosomes to be selected, and selecting the next generation of chromosomes therefrom by means of constrained stable matching operation; and d. if a termination condition is satisfied, terminating the algorithm; and if not, returning to step b. The present invention introduces a constrained stable matching strategy to the process of selecting child chromosomes to solve the multi-target flexible job-shop scheduling problem, overcoming the disadvantages of population distribution and poor convergence of the existing multi-target flexible job-shop scheduling problem solving method when being used for solving such problems, being able to obtain a more excellent scheduling solution, having good real-time performance and high reliability.