Author:
den Besten Matthijs,Stützle Thomas,Dorigo Marco
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. T.S. Abdul-Razaq, C.N. Potts, and L.N. Van Wassenhove. A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discrete Applied Mathematics, 26:235–253, 1990.
2. E.B. Baum. Towards practical “neural” computation for combinatorial optimization problems. In J. Denker, editor, Neural Networks for Computing, pages 53–64, 1986. AIP conference proceedings.
3. R.K. Congram, C.N. Potts, and S.L. Van de Velde. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, to appear, 2000.
4. H.A.J. Crauwels, C.N. Potts, and L.N. Van Wassenhove. Local search heuristics for the single machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 10(3):341–350, 1998.
5. Lect Notes Comput Sci;M. Besten den,2000
Cited by
30 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献