2-approximation algorithms for two variants of the static stochastic joint replenishment problem

IF 0.8 4区 管理学 Q4 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Guillaume Massonnet , Gautier Stauffer
{"title":"2-approximation algorithms for two variants of the static stochastic joint replenishment problem","authors":"Guillaume Massonnet ,&nbsp;Gautier Stauffer","doi":"10.1016/j.orl.2025.107321","DOIUrl":null,"url":null,"abstract":"<div><div>In this work, it is demonstrated that the technique developed by Gayon et al. (2017) <span><span>[11]</span></span> for designing 2-approximation algorithms for the one-warehouse multi-retailer (OWMR) problem is highly versatile and can be applied to stochastic variants of the original OWMR problem. The mechanics of this approach are illustrated on two (static) stochastic variants of the Joint Replenishment Problem (JRP). Additionally, the simplicity and versatility of this technique suggest its potential for broader applications in the stochastic setting.</div></div>","PeriodicalId":54682,"journal":{"name":"Operations Research Letters","volume":"62 ","pages":"Article 107321"},"PeriodicalIF":0.8000,"publicationDate":"2025-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Operations Research Letters","FirstCategoryId":"91","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0167637725000823","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

Abstract

In this work, it is demonstrated that the technique developed by Gayon et al. (2017) [11] for designing 2-approximation algorithms for the one-warehouse multi-retailer (OWMR) problem is highly versatile and can be applied to stochastic variants of the original OWMR problem. The mechanics of this approach are illustrated on two (static) stochastic variants of the Joint Replenishment Problem (JRP). Additionally, the simplicity and versatility of this technique suggest its potential for broader applications in the stochastic setting.
静态随机联合补给问题的2-逼近算法
在这项工作中,证明了Gayon等人(2017)[11]开发的用于为一仓库多零售商(OWMR)问题设计2-逼近算法的技术是高度通用的,可以应用于原始OWMR问题的随机变体。联合补给问题(JRP)的两个(静态)随机变量说明了这种方法的机制。此外,该技术的简单性和通用性表明它在随机环境中有更广泛的应用潜力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Operations Research Letters
Operations Research Letters 管理科学-运筹学与管理科学
CiteScore
2.10
自引率
9.10%
发文量
111
审稿时长
83 days
期刊介绍: Operations Research Letters is committed to the rapid review and fast publication of short articles on all aspects of operations research and analytics. Apart from a limitation to eight journal pages, quality, originality, relevance and clarity are the only criteria for selecting the papers to be published. ORL covers the broad field of optimization, stochastic models and game theory. Specific areas of interest include networks, routing, location, queueing, scheduling, inventory, reliability, and financial engineering. We wish to explore interfaces with other fields such as life sciences and health care, artificial intelligence and machine learning, energy distribution, and computational social sciences and humanities. Our traditional strength is in methodology, including theory, modelling, algorithms and computational studies. We also welcome novel applications and concise literature reviews.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信