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.

[1]  Yu Zhang,et al.  Job shop dynamic scheduling model based on multi-agent , 2008, 2008 Chinese Control and Decision Conference.

[2]  Huang Ting-lei,et al.  Research of Multi-resource Dynamic Job-Shop Scheduling Based on the Hybrid Genetic Algorithm , 2009, 2009 Third International Conference on Genetic and Evolutionary Computing.

[3]  Tao Ze,et al.  Hybrid genetic-Tabu Search approach to scheduling optimization for dual-resource constrained job shop , 2011, Proceedings of 2011 Cross Strait Quad-Regional Radio Science and Wireless Technology Conference.

[4]  Robert W. Brennan,et al.  Holonic job shop scheduling using a multiagent system , 2005, IEEE Intelligent Systems.

[5]  Ye Li,et al.  Neural network and genetic algorithm-based hybrid approach to dynamic job shop scheduling problem , 2009, 2009 IEEE International Conference on Systems, Man and Cybernetics.

[6]  Lale Özbakır,et al.  Mathematical models for job-shop scheduling problems with routing and process plan flexibility , 2010 .

[7]  Abolfazl Mirzazadeh,et al.  A genetic algorithm for the integrated scheduling model of a container-handling system in a maritime terminal , 2012 .