基于时间-费用约束的虚拟物流企业项目分解研究  

Research on Decomposition of Virtual Logistics Enterprise Project Based on Time and Cost

作　　者：盛立新[1,2] 张志勇[1] 匡兴华[1] 

机构地区：[1]国防科技大学信息系统与管理学院,长沙410073 [2]湖南省标准化研究院,长沙410007

出　　处：《武汉理工大学学报（交通科学与工程版）》2009年第2期394-397,共4页Journal of Wuhan University of Technology（Transportation Science & Engineering）

基　　金：湖南省标准化战略专项资助(批准号:2008018;2008030)

摘　　要：考虑时间和费用约束条件下的虚拟物流企业项目分解.找出虚拟物流网络中的最短时延路,若该路的时延大于时间约束,则虚拟物流企业盟主认为不能在规定时间内完成该虚拟物流项目,拒绝该物流项目;反之,则从所有满足时间约束的路中挑出一条最小费用的路,通过此路进行分解,若时间和费用都满足虚拟物流企业盟主的期望,则接受该虚拟物流项目.并给出一个算例.Decomposition of virtual logistics enterprise project （VLEP） is resolving the virtual logistics project into some logistics segment under control. The paper researches the decomposition of VLEP with the constraint of time and cost. The train of thought of decomposition is as following. First, the path of minimal time is found. If the time is greater than the constraint of time is found, the leader of virtual logistics enterprise thinks that he should refuse the project because of the constraint of time. On the contrary, the leader will choose the path which is least cost and get the result of the decomposition of VLEP. If the both time and cost meet the expectation of the leader of virtual logistics enterprise, he will receive the project. The computational experiments is presented in the end.

关 键 词：虚拟物流企业 时间费用 项目分解 

分 类 号：C93[经济管理—管理学]