Operations Research Transactions >
2016 , Vol. 20 >Issue 1: 31 - 42
DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2016.01.003
Three-echelon supply chain scheduling problem with learning effect
Received date: 2015-05-19
Online published: 2016-03-15
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
LIU Ying, ZHANG Xingong . Three-echelon supply chain scheduling problem with learning effect[J]. Operations Research Transactions, 2016 , 20(1) : 31 -42 . DOI: 10.15960/j.cnki.issn.1007-6093.2016.01.003
/
| 〈 |
|
〉 |