A New Approach to Solve Permutation Scheduling Problems with Ant Colony Optimization
暂无分享,去创建一个
[1] G. Di Caro,et al. Ant colony optimization: a new meta-heuristic , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[2] Richard F. Hartl,et al. An ant colony optimization approach for the single machine total tardiness problem , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[3] Daniel Merkle,et al. An Ant Algorithm with a New Pheromone Evaluation Rule for Total Tardiness Problems , 2000, EvoWorkshops.
[4] Thomas E. Morton,et al. The single machine early/tardy problem , 1989 .
[5] Marco Dorigo,et al. The ant colony optimization meta-heuristic , 1999 .
[6] Hartmut Schmeck,et al. Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..
[7] S V Zwaan,et al. ANT COLONY OPTIMISATION FOR JOB SHOP SCHEDULING , 1998 .
[8] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[9] Marco Dorigo,et al. Ant system for Job-shop Scheduling , 1994 .
[10] Matthijs den Besten,et al. Ant Colony Optimization for the Total Weighted Tardiness Problem , 2000, PPSN.
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .