摘要
研究了具有学习效应的三层供应链排序问题.多个客户分布在不同位置,每个客户都有订单需要制造商进行生产.制造商需要针对每一个不同订单的客户从不同的地方进购对应的原材料进行生产,生产完工后需要利用有限的车辆将工件运输到相应客户处.要求每辆运输车装载尽可能多的货物才开始运输.利用动态规划算法研究了最大流程时间、总流程时间以及最大延迟三个目标函数.
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.
出处
《运筹学学报》
CSCD
北大核心
2016年第1期31-42,共12页
Operations Research Transactions
基金
国家自然科学基金(Nos.11401065
1571321)
中国博士后基金(Nos.2013M540698
2014T70854)
重庆市自然科学基金(No.cstc2014jcyjA00003)
重庆师范大学重点项目(No.2011XLZ05)
关键词
排序
供应链排序
学习效应
动态规划
scheduling
supply chain scheduling
learning effect
dynamic programming
