|
With the global economic integration and the advent of the knowledge-based economy, the increasingly fierce competition among enterprises. If a business does not have a strong competitive on the market in this society it is difficult to survive. For processing and manufacturing, at the lowest cost in the shortest possible time to create a product of customer satisfaction, is undoubtedly a powerful means for enterprises to increase their competitiveness. Therefore, how to use limited resources, reduce production costs, and shorten the product manufacturing cycle to ensure timely delivery, improve corporate reputation, win more customers and become one of the important condition for the survival of the manufacturing industry in competition. The effective use of existing resources, production plans work out a rational enterprise and workshop to workshop production efficient whims and high reliability will be key to the production of the enterprise. Analysis of the workshop scheduling problems, combined with the technology of graph theory, shop scheduling model (G-JSHOP). Shop scheduling complexity, solving the problem of the job shop scheduling critical path for solving the problem, namely the use of critical path technology shop scheduling problem. Critical path technology and genetic algorithm combined shop scheduling problem. In the process of the preparation of the shop scheduling scheme, each workpiece machining process route, processing time and processing costs is known, however, the order of the machining of the workpiece of each machine can be adjusted, and this processing sequence play decision-making role. This paper is started from the decision-making routes, genetic algorithm, a decision-making routes into the decision-making matrix, and decision matrix as the individuals in the population. Since the number and the number of steps of each machine internal machining of the workpiece is fixed, so the only step of allowing the inside of the machine to be adjusted, i.e. all machines only internal processing of the largest the workpiece number k as a genome. Using selection operator, crossover and mutation operator of k-bit genome to the next generation, and finally, after several generations of evolution, eventually get a sub-optimal solution. In this thesis, the critical path technology applied to the mold production management, first introduced in the mold production management job shop scheduling; Second, the analysis of the functional architecture and its characteristics; Finally, the analysis of the production planning and plant-level workshop level production planning, and the two plan to interface between a two scheduling production planning, and the plan and critical path combined to solve mold production scheduling problem. Through the analysis of the test, the algorithm has shorten the overall processing time of the mold.
|