The Study Of Job-shop Scheduling Problem Of Maintenance Machine Manufacture Based-on GA

Computer Integrated Manufacturing System (CIMS) can greatly promote the synthesized economic profit of the enterprise, thus it has become the hotspot of the research and application of all kinds of enterprises. As an important part of CIMS, the production planning and scheduling system is an obligatory layer in the CIMS function structure model. Scheduling problem is combinatorial optimization problem, which belongs to NP problem. Many intelligent computation methods such as Simulated Algorithm(SA), Genetic Algorithm(GA), are introduced into scheduling problem in recent years.The maintenance machine manufacture has the feature of variety and small quantities. The insufficiency of resources in the shop floor holds back the accomplishment of production plans. In a sense, whether the enterprise can survive market competition is determined by whether it can meet customers' demands in time, which is further determined by how efficiently the limited resources are used. The assignment of a schedule is that according to produce goal and restriction to arrange the detailed process line,time,machine and operation etc. So good schedule methods can enhance manufacture systems' optimization character and economy benefit.This paper mainly studied workshop scheduling of maintenance machine.This paper introduces the theory and developments about workshop scheduling, as well as optimization algorithm of workshop scheduling. Inview of the production process, it describes the workshop, the existing production craft and the conventional scheduling method. Establishing the scheduling model. The author recounts the implementation procedures of GA, and several mutation and crossover operator. Then according to workshop scheduling problem about maintenance machine, the paper proposes a genetic algorithm and shows schedule Gantt pictures of arithmetic examples. The example proves that the schedule of simulation is superior to theoretic schedule.