Off-line Scheduling of k-Truck Problem and Its MCMF Algorithm
局外k-卡车调度问题及其MCMF法求解

In the field of the optimization, the research concerning on-line problem and its 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 MCMF algorithm, which is used to solve the problem after constructing a weighted directed graph, is presented; the complexities of the DP and MCMF algorithms are given and proved; a simple example is given to explain the MCMF algorithm.