The Joint Replenishment Problem with Cycle Time Constraints under General-Integer Policy

Yu Liang Lin, Ming Jong Yao

研究成果: Conference contribution同行評審

摘要

The joint replenishment problem (JRP) is to determine the replenishment cycle times of a group of items over an infinite planning horizon. We investigated the JRP with cycle time constraints under general-integer policy that are popular in industries and can be extended to minimum order quantity, delivery frequency, and storage capacity constraints. Based on our theoretical analysis on the optimality solution structures, we categorized the items into four types and developed an efficient algorithm for solving this constrained JRP. Our numerical experiments demonstrated that the proposed algorithm is effective and performs better than the existing approaches in the literature.

原文English
主出版物標題2021 International Conference on Optimization and Applications, ICOA 2021
發行者Institute of Electrical and Electronics Engineers Inc.
ISBN(電子)9781665441032
DOIs
出版狀態Published - 19 5月 2021
事件7th International Conference on Optimization and Applications, ICOA 2021 - Wolfenbuttel, Germany
持續時間: 19 5月 202120 5月 2021

出版系列

名字2021 International Conference on Optimization and Applications, ICOA 2021

Conference

Conference7th International Conference on Optimization and Applications, ICOA 2021
國家/地區Germany
城市Wolfenbuttel
期間19/05/2120/05/21

指紋

深入研究「The Joint Replenishment Problem with Cycle Time Constraints under General-Integer Policy」主題。共同形成了獨特的指紋。

引用此