An efficient search algorithm for obtaining the optimal replenishment strategies in assembly-type just-in-time supply chain systems

Ming-Jong Yao*, Tien Cheng Hsu

*Corresponding author for this work

研究成果: Article同行評審

3 引文 斯高帕斯(Scopus)

摘要

An assembly-type just-in-time (JIT) supply chain system is composed of a main serial supply chain and several branching serial supply chains merging to the main supply chain. Under the assumption of constant demand rate, the replenishment problem in the assembly-type JIT supply chain systems can be formulated as a mixed-integer non-linear programming problem. We conduct thorough theoretical analysis on the properties of the objective function value curve in this study. Following our theoretical analysis, we propose a search algorithm that effectively solves an optimal solution. Our numerical experiments show that the average run time of the proposed algorithm grows in a linear order of the problem size, and the proposed algorithm may serve as an efficient solution approach for the decision-maker.

原文English
頁(從 - 到)118-128
頁數11
期刊Journal of Industrial and Production Engineering
35
發行號2
DOIs
出版狀態Published - 17 二月 2018

指紋 深入研究「An efficient search algorithm for obtaining the optimal replenishment strategies in assembly-type just-in-time supply chain systems」主題。共同形成了獨特的指紋。

引用此