Research of Multi-Objective Optimization Study for Job Shop Scheduling Problem Based on Grey Ant Colony Algorithm

Article Preview

Abstract:

In order to resolve Multi-objective job shop scheduling problem, an optimization method of many goals scheduling based on grey relation theory and ant colony algorithm is proposed. Firstly, this paper introduces the relevant mathematical theory. AHP and Grey relational analysis, and they are combined to solve the choice of pre-processing equipment under the multi-objective conditions. What's more, ant colony algorithm is discussed to solve problem of processing order for machine. The effectiveness of multi-objective algorithm for job shop scheduling problem is verified through applying example.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 308-310)

Pages:

1033-1036

Citation:

Online since:

August 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Ying Liu, Jian Ma. Job shop scheduling algorithm based on making multi-objective decision [J], China's manufacturing industry information, 2007,36 (21) :14-18. In Chinese.

Google Scholar

[2] Hongwei Gao, Weiming Tong. Evaluation of AHP and Grey combination. Harbin Engineering University Report, 2008,29 (12) :1309-1314. In Chinese.

Google Scholar

[3] Youxin Luo, Long ting Zhang, Min Li, et al. Grey System Theory and Its Application in Mechanical Engineering [M], Changsha National Defense University Press,2001:18-24.In Chinese.

Google Scholar

[4] Fox B., Xiang W., Lee. HP, Industrial applications of the ant colony optimization algorithm, Int. J Adv. Manu. Tech., 2007, V ol1.31, 805 - 814.

DOI: 10.1007/s00170-005-0254-z

Google Scholar

[5] Yadong Fang. Xi'an: Northwestern Polytechnic University , 2006:73-94. In Chinese.

Google Scholar