The Research And Application Of Job Shop Scheduling Problem Of An Enterprise Based On Memetic Algorithm

With the rising popularity of the information technology in the modern manufacturing enterprises in the manufacturing process,ERP system has become an effective tool for the management of modern enterprises,domestic and foreign enterprises also make efforts to adapt themselves to the development of enterprises and enhance their market competitiveness by developing ERP system.In this context,a company in Liuzhou plans to develop ERP system,in order to improve their productivity and business management.The production model of the company is small amount and many kinds of productions,which conform the model of flexible job shop scheduling problem(FJSP).By studying flexible job shop scheduling problem during the production,it solves problems such as waste of resources by irrational scheduling,thereby increasing the efficiency of production job management.Based on the research of the company in Liuzhou,the point of this paper is to research the flexible job shop scheduling problem in ERP system.For the shortcomings of traditional memetic algorithm,such as being easy to fall into local optimal solution,offering a new memetic algorithm,this paper uses honeybees mating optimization algorithm as global search strategy,designs the double integer coding method,combined with several neighborhood structures for individuals for local search using simulated annealing algorithm and improve the algorithm accuracy.At the same time,this paper gives a requirement analysis of the ERP system with which gives a detailed design of the ERP system,including the design of overall system architecture,the detailed function design of the each module and the design of database.The main results of this paper are:(1)Giving a requirement analysis for a company in Liuzhou,carrying out a detailed functional module division on the ERP system,and giving detailed architecture design and function design(2)For the flexible job shop scheduling problem in sub-module of manufacturing jobs,using honeybees mating optimization algorithm as global search strategy,design the double integer coding method,combined with several neighborhood structures for individuals for local search using simulated annealing algorithm to solve the problem which objective is the maximum completion time.(3)Applying the improved algorithm to sub-module of production job management in the ERP system to achieve a practical workshop scheduling problem.In this paper,research on FJSP through multiple comparative experiments illustrates the effectiveness of the algorithm,and verifies that the algorithm has better search capability in solving the problem of the optimal solution.Finally,the algorithm is applied to sub-module of production job management in the ERP system,indicating the feasibility of the algorithm in practical application.