首页 | 本学科首页   官方微博 | 高级检索  
     

带有路径和运输方式选择的供应链排序算法研究
引用本文:张贝,常慧.带有路径和运输方式选择的供应链排序算法研究[J].洛阳理工学院学报(自然科学版),2012(1):63-66.
作者姓名:张贝  常慧
作者单位:曲阜师范大学管理学院
基金项目:国家自然科学基金(11071142);山东省自然科学基金(ZR2010AM034))
摘    要:主要研究了在供应链中具有单台机器的单个制造商、多个客户的生产和运输的集成排序问题。以生产排序和运输的总费用达到最小作为目标函数。其中生产排序费用是用工件送达时间的函数表示,发送费用是由固定费用和可变费用组成,可变费用与路径和运输方式的选择有关。对该问题的两类特殊情形给出了基于动态规划的多项式时间算法。

关 键 词:排序  供应链  配送  分批  多项式时间算法

The Algorithm Research of Supply Chain Scheduling Problem with Optional Path and Transportation Mode
ZHANG Bei,CHANG Hui.The Algorithm Research of Supply Chain Scheduling Problem with Optional Path and Transportation Mode[J].Journal of Luoyang Institute of Science and Technology,2012(1):63-66.
Authors:ZHANG Bei  CHANG Hui
Affiliation:(Qvfu Normal University,Rizhao 276826,China)
Abstract:This paper mainly studies the integrated production and transportation scheduling problem in the supply chain with one-machine single manufacturer and multi-customers.An objective function will be determined at the least total cost of production scheduling and transportation,among which the production cost is measured by the function of the delivery time,and the transportation fees are composed of stable fees and changeable fees which are concerned with the option of path and transportation mode.A polynomial time algorithm based on dynamic planning is also given for two special cases of this problem.
Keywords:scheduling  supply chain  distribution  batching  polynomial time algorithm
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号