[1]CLEVELAND G A, SMITH S F. Using genetic algorithms to schedule flow shop release[A].Proceedings of the 3rd International Conference on Genetic Algorithms(ICGA)[C]. San Mateo: Morgan Kaufmann Publishers, Inc.,1989.160-169.
[2]JAIN A S, MEERAN S. Deterministic job-shop scheduling:past,present and future[J].European Journal of Operational Research,1999,113(2):390-434.
[3]LEE D Y, DICESARE F.Scheduling flexible manufacturing systems using Petri nets and heuristic search[J]. IEEE Transaction on Robotics and Automation, 1994,10(2):123-132.
[4]JIANG Sijie, XU Xiaofei, LI Quanlong. An optimal algorithm for a class of
Jobshop scheduling problems[J].Computer Integrated Manufacturing Systems,2002,8(3):229-232(in
Chinese).[姜思杰,徐晓 飞,李全龙.基于遗传优化算法求解作业车间调度问题[J].计算机集成制造系统,2002,8(3):229-232.]
[5]SHMOYS D B,STEIN C J W. Improved approximation algorithms for shop scheduling problems[J]. SIAM Journal on Computing,1994, 23:617-632.
[6]DORIGO M, MANIEZZO V,COLORNI A.The ant system:optimization by a colony of cooperating agents[J]. IEEE Transactions on Systems, Man and Cybernetics-Part B,1996,26(1):29-41.
[7]DORIGO M,STTZLE T.An experimental study of the simple ant colony optimization algorithm[A].WSES International Conference on Evolutionary Computation (EC01)[C].Athens:WSES-Press, 2001.253-258.
[8]ZWAAN van der S,MARQUES C. Ant colony optimization for job shop scheduling[A]. Proceedings of the Third Workshop on Genetic Algorithms and Artificial Life (GAAL 99)[C].1999.
|