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

具有学习效应的三层供应链排序问题
引用本文:刘颖,张新功. 具有学习效应的三层供应链排序问题[J]. 运筹学学报, 2016, 20(1): 31-42. DOI: 10.15960/j.cnki.issn.1007-6093.2016.01.003
作者姓名:刘颖  张新功
作者单位:1. 重庆师范大学数学科学学院,重庆 400047
基金项目:国家自然科学基金(Nos. 11401065, 1571321), 中国博士后基金(Nos. 2013M540698, 2014T70854), 重庆市自然科学基金(No. cstc2014jcyjA00003), 重庆师范大学重点项目(No. 2011XLZ05)
摘    要:研究了具有学习效应的三层供应链排序问题. 多个客户分布在不同位置,每个客户都有订 单需要制造商进行生产. 制造商需要针对每一个不同订单的客户从不同的地方进购对应的原材料进行生产,生产完工后需要利用有限的车辆将工件运输到相应客户处. 要求每辆运输车装载尽可 能多的货物才开始运输. 利用动态规划算法研究了最大流程时间、总流程时间以及最大延迟三个目标函数.

关 键 词:排序  供应链排序  学习效应  动态规划  
收稿时间:2015-05-19

Three-echelon supply chain scheduling problem with learning effect
LIU Ying,ZHANG Xingong. Three-echelon supply chain scheduling problem with learning effect[J]. OR Transactions, 2016, 20(1): 31-42. DOI: 10.15960/j.cnki.issn.1007-6093.2016.01.003
Authors:LIU Ying  ZHANG Xingong
Affiliation:1. College of Mathematics Science, Chongqing Normal University, Chongqing 400047,  China
Abstract:This paper studies three-echelon supply chain scheduling problem with learning effect. Multiple customers are distributed in different locations. And some orders of each customer will be processed in manufacturers. Manufacturers need to purchase the corresponding raw materials from different places to process the different orders of different customers. Finally, the processed orders need to be transported the corresponding customer by limited transportation vehicles. The transportation vehicles will transport goods as possible as truck load. We present the three dynamic programming to solve the problems of maximum flow time, total flow time and maximum lateness.
Keywords:scheduling  supply chain scheduling  learning effect  dynamic programming  
本文献已被 CNKI 等数据库收录!
点击此处可从《运筹学学报》浏览原始摘要信息
点击此处可从《运筹学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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