Author:
Pasia Joseph M.,Hartl Richard F.,Doerner Karl F.
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. Lenstra, J., Kan, A., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics 1, 343–362 (1977)
2. Du, J., Leung, J.: Minimizing total tardiness on one machine is np-hard. Mathematics of operations research 15, 483–495 (1990)
3. Dorigo, M., Maniezzo, V., Colorni, A.: Ant System: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics - Part B 26(1), 29–41 (1996)
4. Dorigo, M., Di Caro, G.: The ant colony optimization meta-heuristic. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 11–32. McGraw-Hill, New York (1999)
5. Blum, C.: Beam-ACO - hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers & OR 32, 1565–1591 (2005)
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献