Research on Dynamic Scheduling of Job-Shop Production with the Ant Colony Optimal Algorithm

Abstract:

Job-shop dynamic scheduling is an important subject in the fields of production management and combinatorial optimization. It is usually hard to achieve the optimal solution with classical methods due to the high computational complexity of the problem. A solution of job-shop scheduling problem based on multi-agent is presented for the comparability between the dynamic scheduling problem of job-shop production and the TSP problem. The dynamic scheduling of job-shop production is designed according to the pattern of TSP problem which can be applied with ACO. By the application case, the ACO is the new method to solve the dynamic scheduling of job-shop production.

• Periodical: Applied Mechanics and Materials (Volumes 10-12)
• Pages: 109-113
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.10-12.109
• Online since: December 2007
• Authors: Yong Xian Liu, J. Xiong, B.M. Sun
• Keywords: ACO (Ant Colony Optimal Algorithm), Dynamic Scheduling of Job-Shop Production, NP-Hard (Nondeterministic Polynomial Time-Hard), Particle Swarm Optimization Algorithm (PSO), Path

References

[1] W. Shen and D.H. Norrie: Minneapolis, MN, Vol. 5 (1998), p.117.

[2] L. Q Fan., H.Y. Chang and X.D. Zhu: CIMS, Vol. 11 (2005), p.673.

[3] C. S Zhang and P.F. Yan: Journal of Automation, Vol. 21 (1995), p.706.

[4] Y.X. Liu: the ICMR 2006 conference.