Abstract：Concerning a kind of continuous-time capacitated network with limits on nodes process rate, a shortest dynamic time flow was proposed and its corresponding linear programming form was also given. Based on the inner relationship of the above-mentioned network and the classical continuous-time capacitated network, efficient algorithms in terms of the thought of maximal-received flow and returning flow were designed to precisely solve the shortest dynamic time flow issue in those two kinds of network respectively. Afterwards, the algorithms were proved to be correct and their complexities were also concluded to be small. Finally, an example was used to demonstrate the execution of the algorithm.
2013, Vol. 33 
