The Optimization Model of in Job-Shop Scheduling Problem with Alternative Machines Based on Improved Genetic Algorithm

Abstract:

The job-shop scheduling problem with alternative machines is very complicated and hard to simplify during product management system for discrete manufacturing enterprise. According to the integrated constraint condition of the processing technology and equipment resources, an optimization model for the dispatch plan of processing technology for the gear shaft assembly is analyzed and established in this paper. Furthermore, the optimization results for the process sequence planning of the gear shaft assembly are obtained by iterative algorithm and improved genetic algorithms approach. The calculating program of optimization layout is developed by Matlab. The optimization results show that the production cycle time and operating cost is reduced remarkably and the efficiency is also improved. Through analysis and verification, it is optimal and feasible for discrete manufacturing enterprise in engineering applications.

• Periodical: Applied Mechanics and Materials (Volume 607)
• Pages: 569-572
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.607.569
• Online since: July 2014
• Authors: Qing Chi*, Xiu Li Fu, Ya Nan Pan, Zeng Hui An
• Keywords: Gear Shaft, Genetic Algorithm (GA), Multi-Process Routes, Optimization Model

References

[1] L.F. Liu, Z. M Zhang, X.T. Tian: Machine manufacturing. 2008, 526(6): 59-62.

[2] G.J. Dong, C.T. Shi, T.K. Li, B.L. Wang: Journal of University of Science and Technology Beijing. 2014, 1(1): 123-130.

[3] Y. Zhang, Y.H. Qiu: Computer Engineering and Applications. 2013(12)85-88.

[4] X.L. Wu, S.D. Sun, J.H. Hao: Mechanical Science and Technology. 2006, 4(4): 421-425.

[5] M. Liu Min: Proceedings of the CSU-EPSA. 2009, 35(6): 785-806.

[6] W. Wu, J.G. Lu: Machine Tool & Hydraulics. 2008, 36(3): 176-179.