管理库存系统与双重交付模式和最低订单数量

Yiran Li, Chaolin Yang
{"title":"管理库存系统与双重交付模式和最低订单数量","authors":"Yiran Li, Chaolin Yang","doi":"10.1002/nav.22113","DOIUrl":null,"url":null,"abstract":"We consider an infinite‐horizon periodic‐review inventory system with dual delivery modes, each with a minimum order quantity (MOQ). The expedited mode provides a shorter lead time than the regular mode but has a higher unit ordering cost. As the optimal ordering policy for a system with dual delivery modes and MOQ requirements is unknown and expected to be very complicated, we propose a class of simple policies called single‐index (M,S)$$ \\left(M,S\\right) $$ policies, and we provide an exact procedure to compute the expected long‐run average total cost. Specifically, we first analyze the steady‐state distribution of the inventory position. Then we develop a recursive procedure to determine the steady‐state distribution of the inventory level. In addition, for a special case where ordering from the regular mode follows a base‐stock policy, we apply normal approximation to simplify the exact calculation of the cost. We also study a more complicated class of policies called dual‐index (M,S)$$ \\left(M,S\\right) $$ policies. In numerical studies, we first compare the average cost of the single‐index (M,S)$$ \\left(M,S\\right) $$ policy with that of a modified single‐index policy without MOQ consideration and the (M,S)$$ \\left(M,S\\right) $$ policy for the single‐mode system respectively to investigate the value of the single‐index (M,S)$$ \\left(M,S\\right) $$ policy. In addition, we find that the simpler single‐index (M,S)$$ \\left(M,S\\right) $$ policy performs close to the dual‐index (M,S)$$ \\left(M,S\\right) $$ policy and the optimal policy computed via dynamic programming. Finally, to assess the effectiveness of the normal approximation in the special case, we numerically compare the cost and policy parameters of the exact calculation with those of the normal approximation. The results illustrate that normal approximation not only improves the calculation speed, but also has near‐optimal solutions.","PeriodicalId":19120,"journal":{"name":"Naval Research Logistics (NRL)","volume":"64 5 1","pages":"617 - 636"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Managing inventory systems with dual delivery modes and minimum order quantities\",\"authors\":\"Yiran Li, Chaolin Yang\",\"doi\":\"10.1002/nav.22113\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider an infinite‐horizon periodic‐review inventory system with dual delivery modes, each with a minimum order quantity (MOQ). The expedited mode provides a shorter lead time than the regular mode but has a higher unit ordering cost. As the optimal ordering policy for a system with dual delivery modes and MOQ requirements is unknown and expected to be very complicated, we propose a class of simple policies called single‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policies, and we provide an exact procedure to compute the expected long‐run average total cost. Specifically, we first analyze the steady‐state distribution of the inventory position. Then we develop a recursive procedure to determine the steady‐state distribution of the inventory level. In addition, for a special case where ordering from the regular mode follows a base‐stock policy, we apply normal approximation to simplify the exact calculation of the cost. We also study a more complicated class of policies called dual‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policies. In numerical studies, we first compare the average cost of the single‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policy with that of a modified single‐index policy without MOQ consideration and the (M,S)$$ \\\\left(M,S\\\\right) $$ policy for the single‐mode system respectively to investigate the value of the single‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policy. In addition, we find that the simpler single‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policy performs close to the dual‐index (M,S)$$ \\\\left(M,S\\\\right) $$ policy and the optimal policy computed via dynamic programming. Finally, to assess the effectiveness of the normal approximation in the special case, we numerically compare the cost and policy parameters of the exact calculation with those of the normal approximation. The results illustrate that normal approximation not only improves the calculation speed, but also has near‐optimal solutions.\",\"PeriodicalId\":19120,\"journal\":{\"name\":\"Naval Research Logistics (NRL)\",\"volume\":\"64 5 1\",\"pages\":\"617 - 636\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Naval Research Logistics (NRL)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/nav.22113\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Naval Research Logistics (NRL)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/nav.22113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑一个具有双重交付模式的无限视界定期审查库存系统,每种模式都有最小订货量(MOQ)。加急模式比常规模式提供更短的交货时间,但有更高的单位订购成本。由于具有双交付模式和最小起订量要求的系统的最优订购策略是未知的,并且预计会非常复杂,我们提出了一类简单的策略,称为单索引(M,S) $$ \left(M,S\right) $$策略,并提供了一个精确的过程来计算预期的长期平均总成本。具体来说,我们首先分析了库存头寸的稳态分布。然后,我们开发了一个递归程序来确定库存水平的稳态分布。此外,对于一种特殊情况,即从正则模式排序遵循基本库存策略,我们应用正态近似来简化成本的精确计算。我们还研究了一类更复杂的策略,称为双指标(M,S) $$ \left(M,S\right) $$策略。在数值研究中,我们首先比较了单指数(M,S) $$ \left(M,S\right) $$策略的平均成本与不考虑最小起订量的改进单指数策略的平均成本以及单模系统的(M,S) $$ \left(M,S\right) $$策略的平均成本,以研究单指数(M,S) $$ \left(M,S\right) $$策略的价值。此外,我们发现更简单的单索引(M,S) $$ \left(M,S\right) $$策略执行接近双索引(M,S) $$ \left(M,S\right) $$策略和通过动态规划计算的最优策略。最后,为了评估正态近似在特殊情况下的有效性,我们将精确计算的成本和策略参数与正态近似的成本和策略参数进行了数值比较。结果表明,正态逼近不仅提高了计算速度,而且具有近最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Managing inventory systems with dual delivery modes and minimum order quantities
We consider an infinite‐horizon periodic‐review inventory system with dual delivery modes, each with a minimum order quantity (MOQ). The expedited mode provides a shorter lead time than the regular mode but has a higher unit ordering cost. As the optimal ordering policy for a system with dual delivery modes and MOQ requirements is unknown and expected to be very complicated, we propose a class of simple policies called single‐index (M,S)$$ \left(M,S\right) $$ policies, and we provide an exact procedure to compute the expected long‐run average total cost. Specifically, we first analyze the steady‐state distribution of the inventory position. Then we develop a recursive procedure to determine the steady‐state distribution of the inventory level. In addition, for a special case where ordering from the regular mode follows a base‐stock policy, we apply normal approximation to simplify the exact calculation of the cost. We also study a more complicated class of policies called dual‐index (M,S)$$ \left(M,S\right) $$ policies. In numerical studies, we first compare the average cost of the single‐index (M,S)$$ \left(M,S\right) $$ policy with that of a modified single‐index policy without MOQ consideration and the (M,S)$$ \left(M,S\right) $$ policy for the single‐mode system respectively to investigate the value of the single‐index (M,S)$$ \left(M,S\right) $$ policy. In addition, we find that the simpler single‐index (M,S)$$ \left(M,S\right) $$ policy performs close to the dual‐index (M,S)$$ \left(M,S\right) $$ policy and the optimal policy computed via dynamic programming. Finally, to assess the effectiveness of the normal approximation in the special case, we numerically compare the cost and policy parameters of the exact calculation with those of the normal approximation. The results illustrate that normal approximation not only improves the calculation speed, but also has near‐optimal solutions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Assigning parcel destinations to drop‐off points in a congested robotic sorting system An optimization‐based Monte Carlo method for estimating the two‐terminal survival signature of networks with two component classes A two‐stage adaptive robust model for designing a reliable blood supply chain network with disruption considerations in disaster situations Firm decisions and government subsidies in a supply chain with consumer surplus consideration Optimal emission regulation under market uncertainty
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1