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

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Kai Cheng, Yingxue Yao and Liang Zhou

Pages:

109-113

DOI:

10.4028/www.scientific.net/AMM.10-12.109

Citation:

Y. X. Liu et al., "Research on Dynamic Scheduling of Job-Shop Production with the Ant Colony Optimal Algorithm", Applied Mechanics and Materials, Vols. 10-12, pp. 109-113, 2008

Online since:

December 2007

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.