Abstract
For a purchase-to-order seller, there is no inventory and the seller has to purchase goods to fulfill orders already placed. For each purchase, there is a constant ordering cost. For each order, delay cost will be incurred if it is not fulfilled timely. Consequently, there is a tradeoff between the ordering cost and the delay cost for the seller to make replenishment decisions minimizing the total cost. In practice it is impossible or difficult for the seller to know demand information about future orders in advance, and thus this decision-making problem is of an online fashion. In the previous work, this online problem is classified into three cases according to capacity limit and demand quantity, and a 10-competitive online policy is proposed for the general case. In the present paper, an improved 4-competitive online policy is proposed. Besides, an asymptotic lower bound of 2 is derived for this online decision-making problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data availability
My manuscript has no associated data.
References
Ahlroth L, Schumacher A, Haanpää H (2010) On the power of lookahead in online lot-sizing. Oper Res Lett 38(6):522–526
Albers S (2003) Online algorithms: a survey. Math Program 97(1–2):3–26
Aloulou MA, Dolgui A, Kovalyov MY (2014) A bibliography of non-deterministic lot-sizing models. Int J Prod Res 52(8):2293–2310
Bertsimas D, Thiele A (2006) A robust optimization approach to inventory theory. Oper Res 54(1):150–168
Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge
Buchbinder N, Kimbrel T, Levi R, Makarychev K, Sviridenko M (2013) Online make-to-order joint replenishment model: primal dual competitive algorithms. Oper Res 61(4):1014–1029
Darwish MA, Alkhedher M, Alenezi A (2019) Reducing the effects of demand uncertainty in single-newsvendor multi-retailer supply chains. Int J Prod Res 57(4):1082–1102
De Smet N, Aghezzaf EH, Desmet B (2019) Optimising installation (R, Q) policies in distribution networks with stochastic lead times: a comparative analysis of guaranteed- and stochastic service models. Int J Prod Res 57(13):4148–4165
Gallego G, Moon I (1993) The distribution free newsboy problem: review and extensions. J Oper Res Soc 44(8):825–834
Godichaud M, Amodeo L (2019) EOQ inventory models for disassembly systems with disposal and lost sales. Int J Prod Res 57(18):5685–5704
Johansson L, Olsson F (2017) Quantifying sustainable control of inventory systems with non-linear backorder costs. Ann Oper Res 259(1–2):217–239
KırcıM Biçer I, Seifert RW (2019) Optimal replenishment cycle for perishable items facing demand uncertainty in a two-echelon inventory system. Int J Prod Res 57(4):1250–1264
Larsen KS, Wøhlk S (2010) Competitive analysis of the online inventory problem. Eur J Oper Res 207(2):685–696
Moon I, Gallego G (1994) Distribution free procedures for some inventory models. J Oper Res Soc 45(6):651–658
Ni G (2020) Replenishment policy for a purchase-to-order seller: a tradeoff between ordering cost and delay cost. Int J Prod Res 58(4):1239–1254
Perakis G, Roels G (2008) Regret in the newsvendor model with partial information. Oper Res 56(1):188–203
Priore P, Ponte B, Rosillo R, de la Fuente D (2019) Applying machine learning to the dynamic selection of replenishment policies in fast-changing supply chain environments. Int J Prod Res 57(11):3663–3677
See C, Sim M (2010) Robust approximation to multi-period inventory management. Oper Res 58(3):583–594
Tempelmeier H, Herpers S (2011) Dynamic uncapacitated lot sizing with random demand under a fillrate constraint. Eur J Oper Res 212(3):497–507
van den Heuvel W, Wagelmans APM (2010) Worst case analysis for a general class of on-line lot-sizing heuristics. Oper Res 58(1):59–67
Wagner MR (2010) Fully distribution-free profit maximization: the inventory management case. Math Oper Res 35(4):728–741
Wagner MR (2011) Online lot-sizing problems with ordering, holding and shortage cost. Oper Res Lett 39(2):144–149
Zhang JL, Chen J, Lee CY (2012) Coordinated pricing and inventory control problems with capacity constraints and fixed ordering cost. Nav Res Log 59(5):376–383
Funding
This work is partially supported by Special Funds of Taishan Scholar Project and Startup Program of Doctor Scientific Research in Shandong University of Technology.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author has no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Ni, G. An improved online replenishment policy and its competitive ratio analysis for a purchase-to-order seller. J Comb Optim 46, 13 (2023). https://doi.org/10.1007/s10878-023-01079-6
Accepted:
Published:
DOI: https://doi.org/10.1007/s10878-023-01079-6