Optimal replenishment rate for inventory systems with compound Poisson demands and lost sales: a direct treatment of time-average cost
Supply contracts are designed to minimize inventory costs or to hedge against undesirable events (e.g., shortages) in the face of demand or supply uncertainty. In particular, replenishment terms stipulated by supply contracts need to be optimized with respect to overall costs, profits, service level...
Gespeichert in:
Veröffentlicht in: | Annals of operations research 2022-10, Vol.317 (2), p.665-691 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 691 |
---|---|
container_issue | 2 |
container_start_page | 665 |
container_title | Annals of operations research |
container_volume | 317 |
creator | Katehakis, Michael N. Melamed, Benjamin Shi, Jim Junmin |
description | Supply contracts are designed to minimize inventory costs or to hedge against undesirable events (e.g., shortages) in the face of demand or supply uncertainty. In particular, replenishment terms stipulated by supply contracts need to be optimized with respect to overall costs, profits, service levels, etc. In this paper, we shall be primarily interested in minimizing an inventory cost function with respect to a constant replenishment rate. Consider a single-product inventory system under continuous review with constant replenishment and compound Poisson demands subject to lost-sales. The system incurs inventory carrying costs and lost-sales penalties, where the carrying cost is a linear function of on-hand inventory and a lost-sales penalty is incurred per lost sale occurrence as a function of lost-sale size. We first derive an integro-differential equation for the expected cumulative cost until and including the first lost-sale occurrence. From this equation, we obtain a closed form expression for the time-average inventory cost, and provide an algorithm for a numerical computation of the optimal replenishment rate that minimizes the aforementioned time-average cost function. In particular, we consider two special cases of lost-sales penalty functions: constant penalty and loss-proportional penalty. We further consider special demand size distributions, such as constant, uniform and Gamma, and take advantage of their functional form to further simplify the optimization algorithm. In particular, for the special case of exponential demand sizes, we exhibit a closed form expression for the optimal replenishment rate and its corresponding cost. Finally, a numerical study is carried out to illustrate the results. |
doi_str_mv | 10.1007/s10479-015-1998-y |
format | Article |
fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2730897755</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A724855666</galeid><sourcerecordid>A724855666</sourcerecordid><originalsourceid>FETCH-LOGICAL-c420t-fb27dbb9feedabb669cd773aeaa10bc0f10f392432757728f3ee9aae7f130cec3</originalsourceid><addsrcrecordid>eNp1kd-K1TAQxosoeFx9AO8C3to1f5qm9W5ZXBUW1gu9Dmk66cnSJjWTrvQFfG6zHmFdUAITJvy-b5h8VfWa0XNGqXqHjDaqrymTNev7rt6fVAcmFa97Ibqn1YFy2dRSCPq8eoF4SyllrJOH6ufNmv1iZpJgnSF4PC4QMkkmA3ExER_uSh_TTnDHDAuSHz4fiY3LGrcwki_RI8ZARlhMGJGUQuaImaCZAd8TQ0afwGaSE5j82zs6UkZCbe4gmQmKF-aX1TNnZoRXf-6z6tvVh6-Xn-rrm4-fLy-ua9twmms3cDUOQ-8ARjMMbdvbUSlhwBhGB0sdo070vBFcSaV45wRAbwwoxwS1YMVZ9ebku6b4fQPM-jZuKZSRmitBu14pKR-oqSyhfXAxJ2MXj1ZfKN50UrZtW6jzf1DllL_wNgZwvrw_Erz9SzBs6ANgKeinY8bJbIiPcXbCbYqICZxeU4kq7ZpRfR-6PoWuS-j6PnS9Fw0_abCwYYL0sN__Rb8ATNGybg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2730897755</pqid></control><display><type>article</type><title>Optimal replenishment rate for inventory systems with compound Poisson demands and lost sales: a direct treatment of time-average cost</title><source>Business Source Complete</source><source>SpringerLink Journals - AutoHoldings</source><creator>Katehakis, Michael N. ; Melamed, Benjamin ; Shi, Jim Junmin</creator><creatorcontrib>Katehakis, Michael N. ; Melamed, Benjamin ; Shi, Jim Junmin</creatorcontrib><description>Supply contracts are designed to minimize inventory costs or to hedge against undesirable events (e.g., shortages) in the face of demand or supply uncertainty. In particular, replenishment terms stipulated by supply contracts need to be optimized with respect to overall costs, profits, service levels, etc. In this paper, we shall be primarily interested in minimizing an inventory cost function with respect to a constant replenishment rate. Consider a single-product inventory system under continuous review with constant replenishment and compound Poisson demands subject to lost-sales. The system incurs inventory carrying costs and lost-sales penalties, where the carrying cost is a linear function of on-hand inventory and a lost-sales penalty is incurred per lost sale occurrence as a function of lost-sale size. We first derive an integro-differential equation for the expected cumulative cost until and including the first lost-sale occurrence. From this equation, we obtain a closed form expression for the time-average inventory cost, and provide an algorithm for a numerical computation of the optimal replenishment rate that minimizes the aforementioned time-average cost function. In particular, we consider two special cases of lost-sales penalty functions: constant penalty and loss-proportional penalty. We further consider special demand size distributions, such as constant, uniform and Gamma, and take advantage of their functional form to further simplify the optimization algorithm. In particular, for the special case of exponential demand sizes, we exhibit a closed form expression for the optimal replenishment rate and its corresponding cost. Finally, a numerical study is carried out to illustrate the results.</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/s10479-015-1998-y</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Analysis ; Business and Management ; Closed form solutions ; Combinatorics ; Contracts ; Cost function ; Costs ; Demand ; Demand (Economics) ; Differential equations ; Exact solutions ; Fines & penalties ; Inventory ; Inventory control ; Inventory management ; Linear functions ; Mathematical analysis ; Numerical analysis ; Operations research ; Operations Research/Decision Theory ; Optimization ; Penalty function ; Poisson distribution ; Replenishment ; Sales ; Theory of Computation</subject><ispartof>Annals of operations research, 2022-10, Vol.317 (2), p.665-691</ispartof><rights>Springer Science+Business Media New York 2015</rights><rights>COPYRIGHT 2022 Springer</rights><rights>Springer Science+Business Media New York 2015.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c420t-fb27dbb9feedabb669cd773aeaa10bc0f10f392432757728f3ee9aae7f130cec3</citedby><cites>FETCH-LOGICAL-c420t-fb27dbb9feedabb669cd773aeaa10bc0f10f392432757728f3ee9aae7f130cec3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10479-015-1998-y$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10479-015-1998-y$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>Katehakis, Michael N.</creatorcontrib><creatorcontrib>Melamed, Benjamin</creatorcontrib><creatorcontrib>Shi, Jim Junmin</creatorcontrib><title>Optimal replenishment rate for inventory systems with compound Poisson demands and lost sales: a direct treatment of time-average cost</title><title>Annals of operations research</title><addtitle>Ann Oper Res</addtitle><description>Supply contracts are designed to minimize inventory costs or to hedge against undesirable events (e.g., shortages) in the face of demand or supply uncertainty. In particular, replenishment terms stipulated by supply contracts need to be optimized with respect to overall costs, profits, service levels, etc. In this paper, we shall be primarily interested in minimizing an inventory cost function with respect to a constant replenishment rate. Consider a single-product inventory system under continuous review with constant replenishment and compound Poisson demands subject to lost-sales. The system incurs inventory carrying costs and lost-sales penalties, where the carrying cost is a linear function of on-hand inventory and a lost-sales penalty is incurred per lost sale occurrence as a function of lost-sale size. We first derive an integro-differential equation for the expected cumulative cost until and including the first lost-sale occurrence. From this equation, we obtain a closed form expression for the time-average inventory cost, and provide an algorithm for a numerical computation of the optimal replenishment rate that minimizes the aforementioned time-average cost function. In particular, we consider two special cases of lost-sales penalty functions: constant penalty and loss-proportional penalty. We further consider special demand size distributions, such as constant, uniform and Gamma, and take advantage of their functional form to further simplify the optimization algorithm. In particular, for the special case of exponential demand sizes, we exhibit a closed form expression for the optimal replenishment rate and its corresponding cost. Finally, a numerical study is carried out to illustrate the results.</description><subject>Algorithms</subject><subject>Analysis</subject><subject>Business and Management</subject><subject>Closed form solutions</subject><subject>Combinatorics</subject><subject>Contracts</subject><subject>Cost function</subject><subject>Costs</subject><subject>Demand</subject><subject>Demand (Economics)</subject><subject>Differential equations</subject><subject>Exact solutions</subject><subject>Fines & penalties</subject><subject>Inventory</subject><subject>Inventory control</subject><subject>Inventory management</subject><subject>Linear functions</subject><subject>Mathematical analysis</subject><subject>Numerical analysis</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Penalty function</subject><subject>Poisson distribution</subject><subject>Replenishment</subject><subject>Sales</subject><subject>Theory of Computation</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>N95</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kd-K1TAQxosoeFx9AO8C3to1f5qm9W5ZXBUW1gu9Dmk66cnSJjWTrvQFfG6zHmFdUAITJvy-b5h8VfWa0XNGqXqHjDaqrymTNev7rt6fVAcmFa97Ibqn1YFy2dRSCPq8eoF4SyllrJOH6ufNmv1iZpJgnSF4PC4QMkkmA3ExER_uSh_TTnDHDAuSHz4fiY3LGrcwki_RI8ZARlhMGJGUQuaImaCZAd8TQ0afwGaSE5j82zs6UkZCbe4gmQmKF-aX1TNnZoRXf-6z6tvVh6-Xn-rrm4-fLy-ua9twmms3cDUOQ-8ARjMMbdvbUSlhwBhGB0sdo070vBFcSaV45wRAbwwoxwS1YMVZ9ebku6b4fQPM-jZuKZSRmitBu14pKR-oqSyhfXAxJ2MXj1ZfKN50UrZtW6jzf1DllL_wNgZwvrw_Erz9SzBs6ANgKeinY8bJbIiPcXbCbYqICZxeU4kq7ZpRfR-6PoWuS-j6PnS9Fw0_abCwYYL0sN__Rb8ATNGybg</recordid><startdate>20221001</startdate><enddate>20221001</enddate><creator>Katehakis, Michael N.</creator><creator>Melamed, Benjamin</creator><creator>Shi, Jim Junmin</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20221001</creationdate><title>Optimal replenishment rate for inventory systems with compound Poisson demands and lost sales: a direct treatment of time-average cost</title><author>Katehakis, Michael N. ; Melamed, Benjamin ; Shi, Jim Junmin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c420t-fb27dbb9feedabb669cd773aeaa10bc0f10f392432757728f3ee9aae7f130cec3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Analysis</topic><topic>Business and Management</topic><topic>Closed form solutions</topic><topic>Combinatorics</topic><topic>Contracts</topic><topic>Cost function</topic><topic>Costs</topic><topic>Demand</topic><topic>Demand (Economics)</topic><topic>Differential equations</topic><topic>Exact solutions</topic><topic>Fines & penalties</topic><topic>Inventory</topic><topic>Inventory control</topic><topic>Inventory management</topic><topic>Linear functions</topic><topic>Mathematical analysis</topic><topic>Numerical analysis</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Penalty function</topic><topic>Poisson distribution</topic><topic>Replenishment</topic><topic>Sales</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Katehakis, Michael N.</creatorcontrib><creatorcontrib>Melamed, Benjamin</creatorcontrib><creatorcontrib>Shi, Jim Junmin</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Katehakis, Michael N.</au><au>Melamed, Benjamin</au><au>Shi, Jim Junmin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal replenishment rate for inventory systems with compound Poisson demands and lost sales: a direct treatment of time-average cost</atitle><jtitle>Annals of operations research</jtitle><stitle>Ann Oper Res</stitle><date>2022-10-01</date><risdate>2022</risdate><volume>317</volume><issue>2</issue><spage>665</spage><epage>691</epage><pages>665-691</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><abstract>Supply contracts are designed to minimize inventory costs or to hedge against undesirable events (e.g., shortages) in the face of demand or supply uncertainty. In particular, replenishment terms stipulated by supply contracts need to be optimized with respect to overall costs, profits, service levels, etc. In this paper, we shall be primarily interested in minimizing an inventory cost function with respect to a constant replenishment rate. Consider a single-product inventory system under continuous review with constant replenishment and compound Poisson demands subject to lost-sales. The system incurs inventory carrying costs and lost-sales penalties, where the carrying cost is a linear function of on-hand inventory and a lost-sales penalty is incurred per lost sale occurrence as a function of lost-sale size. We first derive an integro-differential equation for the expected cumulative cost until and including the first lost-sale occurrence. From this equation, we obtain a closed form expression for the time-average inventory cost, and provide an algorithm for a numerical computation of the optimal replenishment rate that minimizes the aforementioned time-average cost function. In particular, we consider two special cases of lost-sales penalty functions: constant penalty and loss-proportional penalty. We further consider special demand size distributions, such as constant, uniform and Gamma, and take advantage of their functional form to further simplify the optimization algorithm. In particular, for the special case of exponential demand sizes, we exhibit a closed form expression for the optimal replenishment rate and its corresponding cost. Finally, a numerical study is carried out to illustrate the results.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10479-015-1998-y</doi><tpages>27</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0254-5330 |
ispartof | Annals of operations research, 2022-10, Vol.317 (2), p.665-691 |
issn | 0254-5330 1572-9338 |
language | eng |
recordid | cdi_proquest_journals_2730897755 |
source | Business Source Complete; SpringerLink Journals - AutoHoldings |
subjects | Algorithms Analysis Business and Management Closed form solutions Combinatorics Contracts Cost function Costs Demand Demand (Economics) Differential equations Exact solutions Fines & penalties Inventory Inventory control Inventory management Linear functions Mathematical analysis Numerical analysis Operations research Operations Research/Decision Theory Optimization Penalty function Poisson distribution Replenishment Sales Theory of Computation |
title | Optimal replenishment rate for inventory systems with compound Poisson demands and lost sales: a direct treatment of time-average cost |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T00%3A18%3A42IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20replenishment%20rate%20for%20inventory%20systems%20with%20compound%20Poisson%20demands%20and%20lost%20sales:%20a%20direct%20treatment%20of%20time-average%20cost&rft.jtitle=Annals%20of%20operations%20research&rft.au=Katehakis,%20Michael%20N.&rft.date=2022-10-01&rft.volume=317&rft.issue=2&rft.spage=665&rft.epage=691&rft.pages=665-691&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/s10479-015-1998-y&rft_dat=%3Cgale_proqu%3EA724855666%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2730897755&rft_id=info:pmid/&rft_galeid=A724855666&rfr_iscdi=true |