Study Of Mixed-model Hybrid Shop Robust Scheduling Problem Based On Multi-Populations Parallel Genetic Algorithm

With the era of customer demand diversified, multi-species and small quantities of mixed-model production has become the choice of most enterprises. However, the mixed-model production puts forward higher requirements for hybrid shop scheduling decision which the production process consists of the upstream with parts processing and downstream with products mixed-model assembly. Therefore, this paper gives the main research work as follows:First, this paper gives background, significance, literature review, research contents.Second, this paper describes scheduling theories. The paper gives scheduling definition, sorting, objective, constraint and modeling methods.Third, this paper gives a class of mixed-model hybrid shop scheduling problem, builds mixed-model hybrid shop scheduling optimization model and mixed-model hybrid shop robust scheduling optimization model with processing time uncertainty, gives scheduling robustness evaluation indexes.Fourth, this paper applies multi-populations parallel genetic algorithm to solve mixed-model hybrid shop scheduling model and the robust scheduling model, and uses gene re-sequencing to amend illegal operations in the chromosomes.Fivth, this paper takes the mixed-model hybrid shop scheduling problem of refrigerator manufacturing enterprises for an example and validates the model and algorithm.Finally, this paper gives summary of the text and ideas for further research.