Hybrid Genetic Algorithm Based On The Job Shop Scheduling

Job-Shop Production Scheduling is a key processing workshop module,with the function of the organization,the dispatch and the management of the workshop work. Based on the organizational production process,the equipment to produce products or fitting's in effective and the entire principle,the workshop takes the massive work as its essential feature.Job-Shop Production Scheduling must consider what satisfies the duty disposition and the smooth restraint request resource distribution;therefore,it is one of NP difficult problems.Effective methods of production scheduling and optimization of technology research and application for advanced manufacturing have to be taken, improvement of the efficiency of production has become critical.The study of Job-Shop scheduling problem has begun as early as in 1954.The Approach to solving this problem mainly rests on heuristic algorithm,based on priority rules which focus on selected sub-processes from a particular unsorted process.The effective solution and optimization of Job-Shop scheduling problem is a key factor to survive during the competition in the given resources and equipment condtions. The factors manifested in using the corporate existing resources effectively,formulating enterprise and the workshop productive plan reasonably,delivering on timely and so on. The research to the workshop scheduling problem had already more than 50 years long history Overseas,and China had also more than 20 year research experiences.Experts improve the workshop scheduling problem earliest from the enumeration method to the constructivity method to the present domain reconnaissance method.But the researchers who want to solve this difficult problem thoroughly also have massive work to do.This article has conducted more deep research into this domain,has obtained some beneficial results.The concrete work is as follows:1.To propose the background and the significance of the production scheduling question.2.This article has given the definition of workshop job scheduling question and the mathematics description of workshop job scheduling qustion,and discusses the circularity and the computation complexity of the workshop job scheduling question, and review the main process and the method of the research to solve the workshop job scheduling question.3.This article has given the genetic algorithm basic principle,as well as about the algorithm operator design based on the genetic algorithm in solving the workshop job scheduling questions,for example,The selection of the codes,and the variation and the overlapping operator's design,and give the result which uses this method through the example. 4.This article proposed the mixed type genetic algorithm used in solving the Job-Shop scheduling problem unified the workshop job scheduling question after a deep research into the genetic algorithm's basic principle and the method and realization in the technical foundation.In this algorithm,I combine genetic algorithm and the simulation annealing algorithm's good and bad points,and design one new algorithm which mix two kind of merits,and give the result which uses this method through the example.5.Finally,the work which did to this article has carried on the summary,and the beneficial discussion and the forecast to the Job-Shop scheduling problem's future direction.