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

作　　者：Xiaoping Ou Fei Luo Xiaoping Ou;Fei Luo(College of Mathematics and Statistics, Sichuan University of Science and Engineering, Zigong, China)

机构地区：[1]College of Mathematics and Statistics, Sichuan University of Science and Engineering, Zigong, China

出　　处：《Journal of Applied Mathematics and Physics》2022年第12期3749-3757,共9页应用数学与应用物理（英文）

摘　　要：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.

关 键 词：Supply Chain Scheduling Singe-Machine Dynamic Programming Algorithm 

分 类 号：F42[经济管理—产业经济]