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

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 base...

Full description

Saved in:
Bibliographic Details
Published in:Applied Mechanics and Materials Vol. 10-12; pp. 109 - 113
Main Authors: Xiong, J., Sun, B.M., Liu, Yong Xian
Format: Journal Article
Language:English
Published: Zurich Trans Tech Publications Ltd 01.01.2008
Subjects:
ISBN:9780878494705, 0878494707
ISSN:1660-9336, 1662-7482, 1662-7482
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:Selected, peer reviewed papers from the 6th International Conference on e-Engineering & Digital Enterprise Technology, August 26-29, 2007, Harbin, China
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISBN:9780878494705
0878494707
ISSN:1660-9336
1662-7482
1662-7482
DOI:10.4028/www.scientific.net/AMM.10-12.109