Research on the Production Scheduling for Automobile Parts Based on Hybrid Algorithm

The production of automobile parts is a job-shop scheduling problem, which is a NP-hard problem of the combinatorial optimization problems. Traditional algorithms for solving job-shop scheduling problems have their respective limitations. This paper proposes a hybrid algorithm to solve the problem of job-shop scheduling for automobile parts. It combines the advantage of global search ability of genetic algorithm with the strong local search ability of tabu search algorithm. The result of the simulation shows that this method is feasible and efficient.