Continuous-Review (R, nQ) Policies for Inventory Systems with Dual Delivery Modes

We study a continuous-review, infinite-horizon inventory system with compound Poisson demand and dual sourcing/delivery modes. Ordering from either source/mode incurs a fixed cost and the expedited mode provides a shorter lead time than the regular mode. As the optimal ordering policy is unknown, wh...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research 2016-11, Vol.64 (6), p.1302-1319
Hauptverfasser: Zhou, Sean X., Yang, Chaolin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1319
container_issue 6
container_start_page 1302
container_title Operations research
container_volume 64
creator Zhou, Sean X.
Yang, Chaolin
description We study a continuous-review, infinite-horizon inventory system with compound Poisson demand and dual sourcing/delivery modes. Ordering from either source/mode incurs a fixed cost and the expedited mode provides a shorter lead time than the regular mode. As the optimal ordering policy is unknown, while expected to be very complicated, we propose a class of simple policies called single-index ( R, nQ ) policies—when ordering from each mode, based on the inventory position, the system follows an ( R, nQ )-type of policy. We provide an exact procedure to compute the expected long-run average cost. Specifically, we first analyze the steady-state distribution of the inventory position, which is found to be no longer uniform in general as in the classic ( R, nQ ) inventory system where only one delivery mode is available. We then develop a recursive procedure, which overcomes the order-crossing effect, to determine the steady-state distribution of the inventory level. Two simple heuristics for computing near-optimal policy parameters are provided. For a special case where ordering from the regular mode incurs no fixed cost and follows a base-stock policy, we derive closed-form solution bounds by applying normal approximation. To assess the performance of the single-index ( R, nQ ) policy, we further study a more complicated class of policies called dual-index ( R, nQ ) policies and numerically illustrate that the simpler single-index policy performs close to the dual-index policy. Finally, the performance of the single-index policy is also shown comparable to the policy computed via dynamic programming.
doi_str_mv 10.1287/opre.2016.1538
format Article
fullrecord <record><control><sourceid>gale_jstor</sourceid><recordid>TN_cdi_gale_infotracacademiconefile_A472846944</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A472846944</galeid><jstor_id>26153506</jstor_id><sourcerecordid>A472846944</sourcerecordid><originalsourceid>FETCH-LOGICAL-c572t-87c48883372a75bf1780a4491ae5bc5bedb669c8571b42b3297b02e2cf23658f3</originalsourceid><addsrcrecordid>eNqFkt9rFDEQxxdR8Ky--rwgikL3zOb3Ppar1UJFWxV8C9nc7DXHbnIm2WvvvzfLCe3BgQQSmHy-M5PJtyhe12heYyk--k2AOUY1n9eMyCfFrGaYV4xy8rSYIURQRTj9_bx4EeMaIdQwzmbF9cK7ZN3ox1jdwNbCXfn-5rR01x_K7763xkIsOx_KS7cFl3zYlT92McEQyzubbsvzUfflOfR2C_nqq19CfFk863Qf4dW_86T4dfHp5-JLdfXt8-Xi7KoyTOBUSWGolJIQgbVgbVcLiTSlTa2BtYa1sGw5b4xkom4pbgluRIswYNNhwpnsyEnxZp93E_yfEWJSaz8Gl0sqzIXgnGDUPFAr3YOyrvMpaDPYaNQZFVhS3lCaqeoItQIHQffeQWdz-ICfH-HzWsJgzVHBuwNBZhLcp5UeY1SH4OkjsB2jdRDzFu3qNsU9f6wRE3yMATq1CXbQYadqpCZXqMkVanKFmlyRBW_3gnXMv_mYxgSJPLlMMcQfJjI9Lgzxf3n_AifVwRE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2677663209</pqid></control><display><type>article</type><title>Continuous-Review (R, nQ) Policies for Inventory Systems with Dual Delivery Modes</title><source>Jstor Complete Legacy</source><source>Informs</source><source>EBSCOhost Business Source Complete</source><creator>Zhou, Sean X. ; Yang, Chaolin</creator><creatorcontrib>Zhou, Sean X. ; Yang, Chaolin</creatorcontrib><description>We study a continuous-review, infinite-horizon inventory system with compound Poisson demand and dual sourcing/delivery modes. Ordering from either source/mode incurs a fixed cost and the expedited mode provides a shorter lead time than the regular mode. As the optimal ordering policy is unknown, while expected to be very complicated, we propose a class of simple policies called single-index ( R, nQ ) policies—when ordering from each mode, based on the inventory position, the system follows an ( R, nQ )-type of policy. We provide an exact procedure to compute the expected long-run average cost. Specifically, we first analyze the steady-state distribution of the inventory position, which is found to be no longer uniform in general as in the classic ( R, nQ ) inventory system where only one delivery mode is available. We then develop a recursive procedure, which overcomes the order-crossing effect, to determine the steady-state distribution of the inventory level. Two simple heuristics for computing near-optimal policy parameters are provided. For a special case where ordering from the regular mode incurs no fixed cost and follows a base-stock policy, we derive closed-form solution bounds by applying normal approximation. To assess the performance of the single-index ( R, nQ ) policy, we further study a more complicated class of policies called dual-index ( R, nQ ) policies and numerically illustrate that the simpler single-index policy performs close to the dual-index policy. Finally, the performance of the single-index policy is also shown comparable to the policy computed via dynamic programming.</description><identifier>ISSN: 0030-364X</identifier><identifier>EISSN: 1526-5463</identifier><identifier>DOI: 10.1287/opre.2016.1538</identifier><language>eng</language><publisher>Linthicum: INFORMS</publisher><subject>Analysis ; Approximation ; batch ordering ; CONTEXTUAL AREAS ; Cost analysis ; cost evaluation ; Delivery of goods ; dual delivery modes ; Dynamic programming ; fixed order cost ; Inventory management ; Lead time ; Numerical analysis ; Operations research ; Poisson distribution ; Policies ; Steady state</subject><ispartof>Operations research, 2016-11, Vol.64 (6), p.1302-1319</ispartof><rights>2016 INFORMS</rights><rights>COPYRIGHT 2016 Institute for Operations Research and the Management Sciences</rights><rights>Copyright Institute for Operations Research and the Management Sciences Nov/Dec 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c572t-87c48883372a75bf1780a4491ae5bc5bedb669c8571b42b3297b02e2cf23658f3</citedby><cites>FETCH-LOGICAL-c572t-87c48883372a75bf1780a4491ae5bc5bedb669c8571b42b3297b02e2cf23658f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/26153506$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/opre.2016.1538$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,776,780,799,3679,27901,27902,57992,58225,62589</link.rule.ids></links><search><creatorcontrib>Zhou, Sean X.</creatorcontrib><creatorcontrib>Yang, Chaolin</creatorcontrib><title>Continuous-Review (R, nQ) Policies for Inventory Systems with Dual Delivery Modes</title><title>Operations research</title><description>We study a continuous-review, infinite-horizon inventory system with compound Poisson demand and dual sourcing/delivery modes. Ordering from either source/mode incurs a fixed cost and the expedited mode provides a shorter lead time than the regular mode. As the optimal ordering policy is unknown, while expected to be very complicated, we propose a class of simple policies called single-index ( R, nQ ) policies—when ordering from each mode, based on the inventory position, the system follows an ( R, nQ )-type of policy. We provide an exact procedure to compute the expected long-run average cost. Specifically, we first analyze the steady-state distribution of the inventory position, which is found to be no longer uniform in general as in the classic ( R, nQ ) inventory system where only one delivery mode is available. We then develop a recursive procedure, which overcomes the order-crossing effect, to determine the steady-state distribution of the inventory level. Two simple heuristics for computing near-optimal policy parameters are provided. For a special case where ordering from the regular mode incurs no fixed cost and follows a base-stock policy, we derive closed-form solution bounds by applying normal approximation. To assess the performance of the single-index ( R, nQ ) policy, we further study a more complicated class of policies called dual-index ( R, nQ ) policies and numerically illustrate that the simpler single-index policy performs close to the dual-index policy. Finally, the performance of the single-index policy is also shown comparable to the policy computed via dynamic programming.</description><subject>Analysis</subject><subject>Approximation</subject><subject>batch ordering</subject><subject>CONTEXTUAL AREAS</subject><subject>Cost analysis</subject><subject>cost evaluation</subject><subject>Delivery of goods</subject><subject>dual delivery modes</subject><subject>Dynamic programming</subject><subject>fixed order cost</subject><subject>Inventory management</subject><subject>Lead time</subject><subject>Numerical analysis</subject><subject>Operations research</subject><subject>Poisson distribution</subject><subject>Policies</subject><subject>Steady state</subject><issn>0030-364X</issn><issn>1526-5463</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>N95</sourceid><recordid>eNqFkt9rFDEQxxdR8Ky--rwgikL3zOb3Ppar1UJFWxV8C9nc7DXHbnIm2WvvvzfLCe3BgQQSmHy-M5PJtyhe12heYyk--k2AOUY1n9eMyCfFrGaYV4xy8rSYIURQRTj9_bx4EeMaIdQwzmbF9cK7ZN3ox1jdwNbCXfn-5rR01x_K7763xkIsOx_KS7cFl3zYlT92McEQyzubbsvzUfflOfR2C_nqq19CfFk863Qf4dW_86T4dfHp5-JLdfXt8-Xi7KoyTOBUSWGolJIQgbVgbVcLiTSlTa2BtYa1sGw5b4xkom4pbgluRIswYNNhwpnsyEnxZp93E_yfEWJSaz8Gl0sqzIXgnGDUPFAr3YOyrvMpaDPYaNQZFVhS3lCaqeoItQIHQffeQWdz-ICfH-HzWsJgzVHBuwNBZhLcp5UeY1SH4OkjsB2jdRDzFu3qNsU9f6wRE3yMATq1CXbQYadqpCZXqMkVanKFmlyRBW_3gnXMv_mYxgSJPLlMMcQfJjI9Lgzxf3n_AifVwRE</recordid><startdate>20161101</startdate><enddate>20161101</enddate><creator>Zhou, Sean X.</creator><creator>Yang, Chaolin</creator><general>INFORMS</general><general>Institute for Operations Research and the Management Sciences</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>XI7</scope><scope>JQ2</scope><scope>K9.</scope></search><sort><creationdate>20161101</creationdate><title>Continuous-Review (R, nQ) Policies for Inventory Systems with Dual Delivery Modes</title><author>Zhou, Sean X. ; Yang, Chaolin</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c572t-87c48883372a75bf1780a4491ae5bc5bedb669c8571b42b3297b02e2cf23658f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Analysis</topic><topic>Approximation</topic><topic>batch ordering</topic><topic>CONTEXTUAL AREAS</topic><topic>Cost analysis</topic><topic>cost evaluation</topic><topic>Delivery of goods</topic><topic>dual delivery modes</topic><topic>Dynamic programming</topic><topic>fixed order cost</topic><topic>Inventory management</topic><topic>Lead time</topic><topic>Numerical analysis</topic><topic>Operations research</topic><topic>Poisson distribution</topic><topic>Policies</topic><topic>Steady state</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhou, Sean X.</creatorcontrib><creatorcontrib>Yang, Chaolin</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>Business Insights: Essentials</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><jtitle>Operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhou, Sean X.</au><au>Yang, Chaolin</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Continuous-Review (R, nQ) Policies for Inventory Systems with Dual Delivery Modes</atitle><jtitle>Operations research</jtitle><date>2016-11-01</date><risdate>2016</risdate><volume>64</volume><issue>6</issue><spage>1302</spage><epage>1319</epage><pages>1302-1319</pages><issn>0030-364X</issn><eissn>1526-5463</eissn><abstract>We study a continuous-review, infinite-horizon inventory system with compound Poisson demand and dual sourcing/delivery modes. Ordering from either source/mode incurs a fixed cost and the expedited mode provides a shorter lead time than the regular mode. As the optimal ordering policy is unknown, while expected to be very complicated, we propose a class of simple policies called single-index ( R, nQ ) policies—when ordering from each mode, based on the inventory position, the system follows an ( R, nQ )-type of policy. We provide an exact procedure to compute the expected long-run average cost. Specifically, we first analyze the steady-state distribution of the inventory position, which is found to be no longer uniform in general as in the classic ( R, nQ ) inventory system where only one delivery mode is available. We then develop a recursive procedure, which overcomes the order-crossing effect, to determine the steady-state distribution of the inventory level. Two simple heuristics for computing near-optimal policy parameters are provided. For a special case where ordering from the regular mode incurs no fixed cost and follows a base-stock policy, we derive closed-form solution bounds by applying normal approximation. To assess the performance of the single-index ( R, nQ ) policy, we further study a more complicated class of policies called dual-index ( R, nQ ) policies and numerically illustrate that the simpler single-index policy performs close to the dual-index policy. Finally, the performance of the single-index policy is also shown comparable to the policy computed via dynamic programming.</abstract><cop>Linthicum</cop><pub>INFORMS</pub><doi>10.1287/opre.2016.1538</doi><tpages>18</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0030-364X
ispartof Operations research, 2016-11, Vol.64 (6), p.1302-1319
issn 0030-364X
1526-5463
language eng
recordid cdi_gale_infotracacademiconefile_A472846944
source Jstor Complete Legacy; Informs; EBSCOhost Business Source Complete
subjects Analysis
Approximation
batch ordering
CONTEXTUAL AREAS
Cost analysis
cost evaluation
Delivery of goods
dual delivery modes
Dynamic programming
fixed order cost
Inventory management
Lead time
Numerical analysis
Operations research
Poisson distribution
Policies
Steady state
title Continuous-Review (R, nQ) Policies for Inventory Systems with Dual Delivery Modes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T22%3A39%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_jstor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Continuous-Review%20(R,%20nQ)%20Policies%20for%20Inventory%20Systems%20with%20Dual%20Delivery%20Modes&rft.jtitle=Operations%20research&rft.au=Zhou,%20Sean%20X.&rft.date=2016-11-01&rft.volume=64&rft.issue=6&rft.spage=1302&rft.epage=1319&rft.pages=1302-1319&rft.issn=0030-364X&rft.eissn=1526-5463&rft_id=info:doi/10.1287/opre.2016.1538&rft_dat=%3Cgale_jstor%3EA472846944%3C/gale_jstor%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2677663209&rft_id=info:pmid/&rft_galeid=A472846944&rft_jstor_id=26153506&rfr_iscdi=true