English

运筹学学报 >

2016 , Vol. 20 >Issue 1: 31 - 42

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2016.01.003

运筹学

具有学习效应的三层供应链排序问题

展开
  • 1. 重庆师范大学数学科学学院，重庆 400047

收稿日期: 2015-05-19

  网络出版日期: 2016-03-15

基金资助

国家自然科学基金(Nos. 11401065, 1571321), 中国博士后基金(Nos. 2013M540698, 2014T70854), 重庆市自然科学基金(No. cstc2014jcyjA00003),  重庆师范大学重点项目(No. 2011XLZ05)

收起

Three-echelon supply chain scheduling problem with learning effect

Expand
  • 1. College of Mathematics Science, Chongqing Normal University, Chongqing 400047,  China

Received date: 2015-05-19

  Online published: 2016-03-15

Fold

摘要

研究了具有学习效应的三层供应链排序问题. 多个客户分布在不同位置，每个客户都有订 单需要制造商进行生产. 制造商需要针对每一个不同订单的客户从不同的地方进购对应的原材料进行生产，生产完工后需要利用有限的车辆将工件运输到相应客户处. 要求每辆运输车装载尽可 能多的货物才开始运输. 利用动态规划算法研究了最大流程时间、总流程时间以及最大延迟三个目标函数.

关键词： 排序; 供应链排序; 学习效应; 动态规划

本文引用格式

刘颖, 张新功 . 具有学习效应的三层供应链排序问题[J]. 运筹学学报, 2016 , 20(1) : 31 -42 . DOI: 10.15960/j.cnki.issn.1007-6093.2016.01.003

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.

Key words： scheduling; supply chain scheduling; learning effect; dynamic programming

参考文献

[1] Wang L,  Zhang Y Z,  Wang C F.  Supply chain scheduling with learning effects [J]. Journal of Systems Science and Mathematical Sciences, 2013, 33(7): 799-806.
[2] Alessandro A,  Hall N G,  Pacciarelli D. Supply chain scheduling: Sequence coordination [J]. Discrete Applied Mathematics, 2006, 154:  2044-2063.
[3] Chen B,  Lee C Y.  Logistics scheduling with batching and transportation [J].  European Journal of Operation Research, 2008, 189: 871-876.
[4] Averbakh I,  Xue Z H. On-line supply chain scheduling problems with preemption [J].  European Journal of Operational Research , 2007, 181: 500-504.
[5] Hall N G,  Potts C N. Supply chain scheduling:  Batching and delivery [J].  Operations Research, 2003, 51: 566-583.
[6] Nikandish N,  Eshghi K,  Torabi S A. Integrated procurement, production and delivery scheduling in a generalized three stage supply chain [J]. Journal of Industrial and Systems Engineering, 2009, 3:  189-212.
[7] Dawande M,  Geismar H N,  Hall N G,  et al. Supply chain scheduling: Distribution systems [J]. Production and Operations Management, 2006, 15: 243-261.

[8] Selvarajah E,  Zhang R. Supply chain scheduling to minimize holding costs with outsourcing [J]. Annals of Operations Research, 2014, 217: 479-490.
Options
文章导航

/

〈 〉