Study Of The DNA Genetic Algorithms Based On The Dual Resources Constraints

Production scheduling problem is existed in the real industrial engineering environment , Research and application of the scheduling method and optimization technology are a basis and key to realize advanced fabrication and improve productivity effect. After studying production scheduling problem in a deepgoing way , scholars have gradually known that two or more restricted resource are existed in the scheduling problem , restricted resources are not machine equipment but other resources such as worker's quantity and a few auxiliary resources such as transport waits. In production scheduling theory study field,generally, production scheduling problem which is restricted by resources of machine equipment and worker is called scheduling problem based on dual resources constraints.Genetic algorithm is applied to an overall situation search for the isoparametric optimization calculating field and the workshop assignment controller problem. DNA genetic algorithm is based on DNA coding model , Its structure is similar to routine genetic algorithm. Its advantages have rich code and various decoding , gene level operation , and changeable length of DNA chromosome ,it can efficiently solve the workshop scheduling problem.During the study and application of thesis problem, In order to reduce the computation of Decoding, gene transfer operation is adopted to replace the crossover operation , the winner of the operator is reserved in the gene transfer operation ,the calculation for the next generation need not decode. This is good for solving problems.and it can save calculation calculating amount ;To gain big searched volume in evolutionary initial stage and search for optimum accurate solution in evolutionary end stage, dynamic dissociation probability is adopted to carry out dissociation; To improve the legality of variation, the coefficient of the Dynamic mutation probability formula is changed. Re-design the male parents of Crossove in order to keep population's diversity and gain new gene information;Contingency adjustment is done to deal with the situation that the best chromosome in the population does not change that may occur in the evolutionary process , designed the process of DNA genetic algorithm in detail . and applies the improved algorithm in the Shop Scheduling Problem. The experiments show that this method is effective and can be carried out.