%0 Journal Article
%T Off-line Scheduling of k-Truck Problem and Its MCMF Algorithm<br>局外k-卡车调度问题及其MCMF法求解
%A MA Wei-min
%A CHEN Guo-qing
%A <br>马卫民
%A 陈国青
%J 系统工程理论与实践
%D 2005
%I 
%X 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.
%K off-line scheduling of k-trcuck problem
%K MCMF algorithm
%K complexity of algorithm<br>局外k卡车问题
%K MCMF法
%K 算法复杂性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=962324E222C1AC1D&jid=1D057D9E7CAD6BEE9FA97306E08E48D3&aid=CCE1B87B75CE0185&yid=2DD7160C83D0ACED&vid=C5154311167311FE&iid=94C357A881DFC066&sid=6270DC1B5693DDAF&eid=4BB057F167CF3A60&journal_id=1000-6788&journal_name=系统工程理论与实践&referenced_num=0&reference_num=11