A Study On Batch Scheduling Of Automotive Stamping Shop Based On New Neighborhood Structure

In Chinese economic system,automobile manufacturing industry,as the pillar industry of the national economy,is the main force to promote China’s economic development.With the development of China’s automobile manufacturing industry towards the direction of digitalization and intelligence,the demand of enterprises for building digital chemical plants is increasingly strong.Scheduling is an important part of building a digital plant system,which is a basic problem to be solved when building a digital plant.As the first link of the four processes of automobile manufacturing,the production efficiency of automobile stamping process directly determines the production efficiency of automobile manufacturing.The efficient scheduling management can shorten the production time,improve the production management of enterprises,and increase the benefits of enterprises.This paper,take the automobile stamping workshop as the research object.on the basis of analyzing of the production characteristics of batch processing,the optimization scheduling model of automobile stamping workshop is established with the objective function of minimizing the maximum completion time.Tabu search algorithm is a meta heuristic algorithm which is mainly used to solve the scheduling problem.Neighborhood structure and move evaluation strategy have an important impact on the efficiency of the algorithm.Based on the analysis of disjunctive graph model of scheduling problem solution,this paper proposes a new neighborhood structure which can search more solution space and ensure the feasible solution A move evaluation strategy with accurate evaluation value and relatively simple calculation process is designed.Considering the randomness of the batch division in the batch scheduling of automobile stamping shop,the tentative method is used to batch the stamping parts,and the scheduling results after the batch are used to guide the batch scheme.The hybrid GATS algorithm is designed by using the advantages of genetic algorithm and Tabu search algorithm respectively,and is applied to solve the scheduling problem.A large number of problem examples are tested to verify the effectiveness of the hybrid GATS algorithm.