期刊文献+

A Multi-Customer Supply Chain Scheduling with Subcontracting Option on a Single Machine

A Multi-Customer Supply Chain Scheduling with Subcontracting Option on a Single Machine
下载PDF
导出
摘要 This paper studies the cost problem caused by the activity of the work-piece in the supply chain. The objective function is to find an optimal ordering that minimizes the total cost of production, transportation and subcontracting. This paper presents a dynamic programming algorithm for the corresponding sorting problem, and finally demonstrates the feasibility of the algorithm through an example. This paper studies the cost problem caused by the activity of the work-piece in the supply chain. The objective function is to find an optimal ordering that minimizes the total cost of production, transportation and subcontracting. This paper presents a dynamic programming algorithm for the corresponding sorting problem, and finally demonstrates the feasibility of the algorithm through an example.
作者 Xiaoping Ou Fei Luo Xiaoping Ou;Fei Luo(College of Mathematics and Statistics, Sichuan University of Science and Engineering, Zigong, China)
出处 《Journal of Applied Mathematics and Physics》 2022年第12期3749-3757,共9页 应用数学与应用物理(英文)
关键词 Supply Chain Scheduling Singe-Machine Dynamic Programming Algorithm Supply Chain Scheduling Singe-Machine Dynamic Programming Algorithm
  • 相关文献

参考文献2

二级参考文献8

  • 1Hall N G, Ports C N. Supply chain scheduling: Batching and delivery. Operations Research, 2003, 51: 566-583.
  • 2Chen Z L, Variraktarakis G L. Integrated scheduling of production and distribution operations. Management Science, 2005, 51: 614-628.
  • 3Biskup D. Single-machine scheduling with learning considerations. European Journal of Opera- tional Research, 1999, 115: 173-178.
  • 4Kuo W H, Yang D L. Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. European Journal of Operational Research, 2006, 174: 1184-1190.
  • 5Chen Z L. Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 2010, 58: 130-148.
  • 6Biskup D. A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 2008, 188: 318-329.
  • 7Wu C C, Lee W C, Chen T. Heuristic algorithms for solving the maximum lateness scheduling problem with learning considerations. Computers and Industrial Engineerin9, 2007, 52: 124-132.
  • 8Lin B M T. Complexity results for single-machine scheduling with positional learning effects. Journal of the Operational Research Society, 2007, 58: 1099-1102.

共引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部