Off-line scheduling of k-truck problem and its minimum-cost, maximum flow algorithm

In the field of optimization, research concerning on-line problems and solutions becomes an attractive research direction. When we do some research on the on-line problem and its solutions, the off-line problem and its solution must be involved. For the off-line scheduling of k-truck problem, some results were obtained in this paper: a minimum-cost, maximum flow (MCMF) algorithm, which is used to solve the problem after constructing a weighted directed graph, is presented; the complexities of the dynamic programming and MCMF algorithms are given and proved; a simple example is given to explain the MCMF algorithm.