| Article ID: | iaor20062272 |
| Country: | China |
| Volume: | 35 |
| Issue: | 3 |
| Start Page Number: | 89 |
| End Page Number: | 98 |
| Publication Date: | Mar 2005 |
| Journal: | Mathematics in Practice and Theory |
| Authors: | Guo Bo, Zhang Fenglin, Wang Zhengming |
| Keywords: | programming: transportation |
The problem that material is transported from sources to a destination in a network is analyzed, in which the length of the material queue is considered. Under the restriction of the shortest time, an approximate algorithm is bought forward in a network with two sources and a destination. By it, the bounds of transportation time are computed. The achievements in the paper are the basis to make progress.