[1]Garey M R, Johnson D S, Sethy R. The Complexity of Flow Shop and Job Shop Seheduling[J]. Mathematics of Operations Research, 1976, 1 (2): 117- 129.
[2]Dimopoulos C, Zalza A M S. Recent Developments in Evolutionary Computation for Manufacturing Optimization Problems, Solutions, and Computations [J]. IEEE Transactions on Evolutionary Computation,2000,4(2) :93-113.
[3]Valente J M S, Alves R A F S. An Exact Approach to Early/Tardy Scheduling with Release Dates[J] Computers and Operations Research, 2005,32 ( 11 ) :2905-2917.
[4]Lin D, Markis V. On--line Parameter Estimation for a Failure Prone System Subject to Condition Monitoring [J]. Journal of Applied Probability, 2004.41(1) ,211-220.
[5]Macro D, Thomas S. Ant Colony Optimization [M]. Cambridge: MIT Press, 2003.
[6]Ying Kuoching, Liao Chingjong. An Ant Colony System for Permutation Flow-shop Sequencing [J]. Computers & Operation Research, 2004, 31: 791-801.
[7]Apinanthana U, Voratas K. Two--way Scheduling Approach in Ant Algorithm for Solving Job Shop Problem [J]. Industrial Engineering and Management Systems, 2006, 5(2):1-8.
[8]Yi G. Studies on Selecting Partners of Networked Manufacturing Based on ACO[J]. Journal of Com- munication and Computer,2007, 4(5):15-21.
[9]Beasley JE. OR-- Library[EB/OL]. [2009-02-02]. http://people, brunel, ac. uk/- mastijb/jeb/orlib/ jobshopinfo, html.