Minimizing the Total Flow Time of n Jobs on a Network
暂无分享,去创建一个
[1] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[2] A. J. Clewett,et al. Introduction to sequencing and scheduling , 1974 .
[3] Oded Berman,et al. Dynamic Repositioning of Indistinguishable Service Units on Transportation Networks , 1981 .
[4] David Simchi-Levi,et al. Minisum location of a traveling salesman , 1986, Networks.
[5] Teofilo F. Gonzalez,et al. P-Complete Approximation Problems , 1976, J. ACM.
[6] Stuart E. Dreyfus,et al. An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..
[7] Pitu B. Mirchandani,et al. Location on networks : theory and algorithms , 1979 .
[8] E. Minieka. The delivery man problem on a tree network , 1990 .