By taking the problem of transportation assignment as an object for research, the shortest time limit of task sent in advance and the shortest total time of task are presented, at the same time a network model is built in this paper. Based on graph theory, the optimal algorithms are designed by the methods of maximum flow and the shortest time flow. Finally, the experimental calculation is presented.