一类产销不平衡最短时限运输问题的求解  

Solution for an Unbalanced Production-Marketing Shoutest-Time Transportation Problem

作　　者：董丽[1] 周强[1] 郭淑利[1] 

机构地区：[1]信阳师范学院数学与信息科学学院,河南信阳464000

出　　处：《信阳师范学院学报（自然科学版）》2009年第4期503-506,共4页Journal of Xinyang Normal University(Natural Science Edition)

基　　金：河南省教育厅自然科学基金项目(2008A110016)

摘　　要：研究产量大于销量的产销不平衡最短时限运输问题.考虑运输时间与运输量相关,存在禁运与封锁,运输能力限制等情况,给出了多项式时间算法.该算法能够较快地找到最优运输方案.This paper investigates an unbalanced production-marketing shortest-time transportation problem. Under the conditions that supply exceeds demand, the transport time is dependent on the transport capacity, the embargo or blockage is existed, and the transport capability is limited, the polynomial-time algorithm is given. The polynomial- time algorithm can effectively produce the optimal transport scheme.

关 键 词：最短时限运输问题 产销不平衡 禁运与封锁 运输能力 

分 类 号：O223[理学—运筹学与控制论]