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

doi:10.15960/j.cnki.issn.1007-6093.2016.01.003

Abstract

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

Cite this article

LIU Ying, ZHANG Xingong. Three-echelon supply chain scheduling problem with learning effect[J]. Operations Research Transactions, doi: 10.15960/j.cnki.issn.1007-6093.2016.01.003.

share this article

0
/ / Recommend

Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks

URL: https://www.ort.shu.edu.cn/EN/10.15960/j.cnki.issn.1007-6093.2016.01.003

https://www.ort.shu.edu.cn/EN/Y2016/V20/I1/31

References

[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.

Related Articles 15

[1]	ZHAO Congcong, FANG Dandan, LI Rongheng. Optimal algorithms for hybrid flow shop schedule on two machines with learning effect [J]. Operations Research Transactions, 2020, 24(2): 42-60.
[2]	ZHANG Yuzhong. A survey on job scheduling with rejection [J]. Operations Research Transactions, 2020, 24(2): 111-130.
[3]	CHEN Rubing, YUAN Jinjiang. Single-machine scheduling to minimize total weighted late work with positional due-indices [J]. Operations Research Transactions, 2020, 24(2): 131-144.
[4]	LIU Xiaoxia, YU Shanshan, LUO Wenchang. Approximation algorithms for single machine parallelbatch scheduling with release dates subject to the number of rejected jobs not exceeding a given threshold [J]. Operations Research Transactions, 2020, 24(1): 131-139.
[5]	WANG Yizhan, ZHANG An, CHEN Yong, CHEN Guangting. An approximation algorithm for reclaimer scheduling [J]. Operations Research Transactions, 2020, 24(1): 147-154.
[6]	GOU Yan, DAI Qin, ZHANG Xingong. Scheduling problem with time-and-position-dependent effect on two parallel machines environments [J]. Operations Research Transactions, 2019, 23(4): 86-94.
[7]	LI Ganggang, LU Xiwen. An improved algorithm for single-machine scheduling problem with a period of maintenance to minimize total delivery time [J]. Operations Research Transactions, 2019, 23(4): 95-104.
[8]	LI Wenhua, ZHAI Weina, CHAI Xing, GAO Chao. On-line bounded-batching scheduling of unit-length jobs with two families [J]. Operations Research Transactions, 2019, 23(4): 105-110.
[9]	ZHANG Guochuan, CHEN Lin. The load balancing problem [J]. Operations Research Transactions, 2019, 23(3): 1-14.
[10]	ZHONG Weiya, YANG Ruoyao. Scheduling with sub-jobs' due dates [J]. Operations Research Transactions, 2019, 23(2): 67-74.
[11]	CHEN Qiuhong, ZHANG Xingong. Two-agent preemptive scheduling of jobs with fixed time windows problem about total tardiness on a single machine [J]. Operations Research Transactions, 2019, 23(1): 61-71.
[12]	PENG Nannan, ZHANG Yuzhong, BAI Qingguo, WANG Chengfei. Online batch scheduling problem on uniform machines with agreeable processing times [J]. Operations Research Transactions, 2019, 23(1): 111-118.
[13]	CAI Shuang, YANG Ke, LIU Ke. Model and algorithms of the distributed permutation flow shop scheduling problem with machine eligibility constraints [J]. Operations Research Transactions, 2018, 22(4): 17-30.
[14]	XU Weijun, YU Canbin, XU Zhongyue. Multi-stage active portfolio management with multiple constraints and its empirical study [J]. Operations Research Transactions, 2018, 22(4): 57-68.
[15]	ZHAO Xiaocheng, LI Dagang. Parallel machine scheduling with machine and human eligibility restrictions [J]. Operations Research Transactions, 2018, 22(3): 99-108.

Metrics

Viewed

Full text

Abstract

Comments

Abstract
References
Related Articles
Recommended Articles
Metrics
Comments

TOP

Three-echelon supply chain scheduling problem with learning effect

PDF

Knowledge

Cited