Joint scheduling of multiple flexible workshops with serial and parallel heterogeneous process constraints
In order to reduce the total delay time of multi workshop joint scheduling with serial parallel heterogeneous process con-straints,a scheduling solution method based on knowledge guided genetic algorithm was proposed.Firstly,an extended process tree was used to describe the constraints of serial parallel heterogeneous processes,and the distribution of machines in multiple workshops was described based on an undirected graph.To address the constraints of the extended process tree during chromo-some initialization and evolution,the concepts of the number of tight preceding steps and the number of remaining tight preceding steps were defined.Based on the number of remaining tight preceding steps,chromosome initialization and evolution methods were designed.In order to improve the evolutionary ability of genetic algorithms,the population evolutionary ability and the opti-mal individual evolutionary ability were used as knowledge to drive the evolutionary mode and direction of the algorithm,thus a solution method based on knowledge guided genetic algorithm was proposed.After experimental verification,the average total de-lay time of knowledge driven genetic algorithm scheduling is the smallest,at 30.8 hours,indicating that the algorithm has the best optimization performance in multi workshop scheduling.And the length of the total delay time box graph is the smallest,in-dicating that the stability of knowledge driven genetic algorithm is also good.
multi workshop collaborationextended process treetight preceding stepsknowledge guidedgenetic algorithm
国家科技期刊平台
NSTL
万方数据
