Multistage Inventory Management with Expediting
After reformulating Clark and Scarf's (1960) classical serial multi-echelon model so that the lead time between adjacent echelons is one week (period), the option to expedite between each resulting echelon is added. Thus, each week requires a decision to be made at each echelon on how many unit...
Gespeichert in:
| Veröffentlicht in: | Operations research 2000-11, Vol.48 (6), p.878-893 |
|---|---|
| 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 | 893 |
|---|---|
| container_issue | 6 |
| container_start_page | 878 |
| container_title | Operations research |
| container_volume | 48 |
| creator | Lawson, David G Porteus, Evan L |
| description | After reformulating Clark and Scarf's (1960) classical serial multi-echelon model so that the lead time between adjacent echelons is one week (period), the option to expedite between each resulting echelon is added. Thus, each week requires a decision to be made at each echelon on how many units to expedite in from the next upstream echelon (to be received immediately) and how many to regular order (to be received in one week), with the remainder detained (left as is). The model can be interpreted as addressing dynamic lead time management, in which the (remaining) effective lead time for each ordered unit can be dynamically reduced by expediting and/or extended. Use of Clark and Scarf's (1960) idea of echelon stocks reduces a complex, multidimensional stocking problem to the analysis of a series of one-dimensional subproblems. What are called top-down base stock policies , which are readily amenable to managerial interpretation, are shown to be optimal. Myopic policies are shown to be optimal in the stationary, in1nite horizon case. The results are illustrated numerically. |
| doi_str_mv | 10.1287/opre.48.6.878.12399 |
| format | Article |
| fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_jstor_primary_222996</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>222996</jstor_id><sourcerecordid>222996</sourcerecordid><originalsourceid>FETCH-LOGICAL-c368t-1279bf73b3c8d997a1e9b00691e8b499941ce027fc193f8da4c51830b5130d403</originalsourceid><addsrcrecordid>eNqNkD1PwzAQhi0EEqXwC7pEDGxJzx9xfCOqClSiYgGJzcqH07pqk2KnlP57XAKdmU539zxn-SVkRCGhTGXjdutMIlQiE5WpMOKIZ2RAUybjVEh-TgYAHGIuxfslufJ-BQCYynRAxvPdurO-yxcmmjWfpulad4jmeRMGm9BFe9sto-nX1lS2s83imlzU-dqbm986JG8P09fJU_z88jib3D_HJZeqiynLsKgzXvBSVYhZTg0WABKpUYVAREFLAyyrS4q8VlUuypQqDkVKOVQC-JDc9ne3rv3YGd_pVbtzTXhSM4pUiQxogHgPla713plab53d5O6gKehjMPoYjBZKSx2C0T_BBGvUWysfPntSGGOIMmxZv7VN3bqN_-fJu15a2sVybwPwZx9pf8L5N2vAfYE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>219184701</pqid></control><display><type>article</type><title>Multistage Inventory Management with Expediting</title><source>Jstor Complete Legacy</source><source>INFORMS PubsOnLine</source><source>Business Source Complete</source><creator>Lawson, David G ; Porteus, Evan L</creator><creatorcontrib>Lawson, David G ; Porteus, Evan L</creatorcontrib><description>After reformulating Clark and Scarf's (1960) classical serial multi-echelon model so that the lead time between adjacent echelons is one week (period), the option to expedite between each resulting echelon is added. Thus, each week requires a decision to be made at each echelon on how many units to expedite in from the next upstream echelon (to be received immediately) and how many to regular order (to be received in one week), with the remainder detained (left as is). The model can be interpreted as addressing dynamic lead time management, in which the (remaining) effective lead time for each ordered unit can be dynamically reduced by expediting and/or extended. Use of Clark and Scarf's (1960) idea of echelon stocks reduces a complex, multidimensional stocking problem to the analysis of a series of one-dimensional subproblems. What are called top-down base stock policies , which are readily amenable to managerial interpretation, are shown to be optimal. Myopic policies are shown to be optimal in the stationary, in1nite horizon case. The results are illustrated numerically.</description><identifier>ISSN: 0030-364X</identifier><identifier>EISSN: 1526-5463</identifier><identifier>DOI: 10.1287/opre.48.6.878.12399</identifier><identifier>CODEN: OPREAI</identifier><language>eng</language><publisher>Linthicum: INFORMS</publisher><subject>Cost functions ; Dynamic programming, applications: optimality of top-down base stock policies under stochastic demands ; Engines ; Finished goods ; Inventory management ; Inventory production, multi-echelon: decomposition into sequence of one-dimensional problems ; Inventory production, review lead times: dynamically managed expediting ; Minimization of cost ; Optimal policy ; Penalty function ; Streams ; Studies ; Supply ; Supply chain management ; Supply chains ; Unit costs</subject><ispartof>Operations research, 2000-11, Vol.48 (6), p.878-893</ispartof><rights>Copyright 2000 The Institute for Operations Research and the Management Sciences</rights><rights>Copyright Institute for Operations Research and the Management Sciences Nov/Dec 2000</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c368t-1279bf73b3c8d997a1e9b00691e8b499941ce027fc193f8da4c51830b5130d403</citedby><cites>FETCH-LOGICAL-c368t-1279bf73b3c8d997a1e9b00691e8b499941ce027fc193f8da4c51830b5130d403</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/222996$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/opre.48.6.878.12399$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,776,780,799,3679,27901,27902,57992,58225,62589</link.rule.ids></links><search><creatorcontrib>Lawson, David G</creatorcontrib><creatorcontrib>Porteus, Evan L</creatorcontrib><title>Multistage Inventory Management with Expediting</title><title>Operations research</title><description>After reformulating Clark and Scarf's (1960) classical serial multi-echelon model so that the lead time between adjacent echelons is one week (period), the option to expedite between each resulting echelon is added. Thus, each week requires a decision to be made at each echelon on how many units to expedite in from the next upstream echelon (to be received immediately) and how many to regular order (to be received in one week), with the remainder detained (left as is). The model can be interpreted as addressing dynamic lead time management, in which the (remaining) effective lead time for each ordered unit can be dynamically reduced by expediting and/or extended. Use of Clark and Scarf's (1960) idea of echelon stocks reduces a complex, multidimensional stocking problem to the analysis of a series of one-dimensional subproblems. What are called top-down base stock policies , which are readily amenable to managerial interpretation, are shown to be optimal. Myopic policies are shown to be optimal in the stationary, in1nite horizon case. The results are illustrated numerically.</description><subject>Cost functions</subject><subject>Dynamic programming, applications: optimality of top-down base stock policies under stochastic demands</subject><subject>Engines</subject><subject>Finished goods</subject><subject>Inventory management</subject><subject>Inventory production, multi-echelon: decomposition into sequence of one-dimensional problems</subject><subject>Inventory production, review lead times: dynamically managed expediting</subject><subject>Minimization of cost</subject><subject>Optimal policy</subject><subject>Penalty function</subject><subject>Streams</subject><subject>Studies</subject><subject>Supply</subject><subject>Supply chain management</subject><subject>Supply chains</subject><subject>Unit costs</subject><issn>0030-364X</issn><issn>1526-5463</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqNkD1PwzAQhi0EEqXwC7pEDGxJzx9xfCOqClSiYgGJzcqH07pqk2KnlP57XAKdmU539zxn-SVkRCGhTGXjdutMIlQiE5WpMOKIZ2RAUybjVEh-TgYAHGIuxfslufJ-BQCYynRAxvPdurO-yxcmmjWfpulad4jmeRMGm9BFe9sto-nX1lS2s83imlzU-dqbm986JG8P09fJU_z88jib3D_HJZeqiynLsKgzXvBSVYhZTg0WABKpUYVAREFLAyyrS4q8VlUuypQqDkVKOVQC-JDc9ne3rv3YGd_pVbtzTXhSM4pUiQxogHgPla713plab53d5O6gKehjMPoYjBZKSx2C0T_BBGvUWysfPntSGGOIMmxZv7VN3bqN_-fJu15a2sVybwPwZx9pf8L5N2vAfYE</recordid><startdate>20001101</startdate><enddate>20001101</enddate><creator>Lawson, David G</creator><creator>Porteus, Evan L</creator><general>INFORMS</general><general>Operations Research Society of America</general><general>Institute for Operations Research and the Management Sciences</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>88F</scope><scope>8AL</scope><scope>8AO</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</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>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M1Q</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</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>20001101</creationdate><title>Multistage Inventory Management with Expediting</title><author>Lawson, David G ; Porteus, Evan L</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c368t-1279bf73b3c8d997a1e9b00691e8b499941ce027fc193f8da4c51830b5130d403</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Cost functions</topic><topic>Dynamic programming, applications: optimality of top-down base stock policies under stochastic demands</topic><topic>Engines</topic><topic>Finished goods</topic><topic>Inventory management</topic><topic>Inventory production, multi-echelon: decomposition into sequence of one-dimensional problems</topic><topic>Inventory production, review lead times: dynamically managed expediting</topic><topic>Minimization of cost</topic><topic>Optimal policy</topic><topic>Penalty function</topic><topic>Streams</topic><topic>Studies</topic><topic>Supply</topic><topic>Supply chain management</topic><topic>Supply chains</topic><topic>Unit costs</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Lawson, David G</creatorcontrib><creatorcontrib>Porteus, Evan L</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Health & Medical Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (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>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</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>ProQuest Health & Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health & Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</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>Operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Lawson, David G</au><au>Porteus, Evan L</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Multistage Inventory Management with Expediting</atitle><jtitle>Operations research</jtitle><date>2000-11-01</date><risdate>2000</risdate><volume>48</volume><issue>6</issue><spage>878</spage><epage>893</epage><pages>878-893</pages><issn>0030-364X</issn><eissn>1526-5463</eissn><coden>OPREAI</coden><abstract>After reformulating Clark and Scarf's (1960) classical serial multi-echelon model so that the lead time between adjacent echelons is one week (period), the option to expedite between each resulting echelon is added. Thus, each week requires a decision to be made at each echelon on how many units to expedite in from the next upstream echelon (to be received immediately) and how many to regular order (to be received in one week), with the remainder detained (left as is). The model can be interpreted as addressing dynamic lead time management, in which the (remaining) effective lead time for each ordered unit can be dynamically reduced by expediting and/or extended. Use of Clark and Scarf's (1960) idea of echelon stocks reduces a complex, multidimensional stocking problem to the analysis of a series of one-dimensional subproblems. What are called top-down base stock policies , which are readily amenable to managerial interpretation, are shown to be optimal. Myopic policies are shown to be optimal in the stationary, in1nite horizon case. The results are illustrated numerically.</abstract><cop>Linthicum</cop><pub>INFORMS</pub><doi>10.1287/opre.48.6.878.12399</doi><tpages>16</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0030-364X |
| ispartof | Operations research, 2000-11, Vol.48 (6), p.878-893 |
| issn | 0030-364X 1526-5463 |
| language | eng |
| recordid | cdi_jstor_primary_222996 |
| source | Jstor Complete Legacy; INFORMS PubsOnLine; Business Source Complete |
| subjects | Cost functions Dynamic programming, applications: optimality of top-down base stock policies under stochastic demands Engines Finished goods Inventory management Inventory production, multi-echelon: decomposition into sequence of one-dimensional problems Inventory production, review lead times: dynamically managed expediting Minimization of cost Optimal policy Penalty function Streams Studies Supply Supply chain management Supply chains Unit costs |
| title | Multistage Inventory Management with Expediting |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T23%3A57%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Multistage%20Inventory%20Management%20with%20Expediting&rft.jtitle=Operations%20research&rft.au=Lawson,%20David%20G&rft.date=2000-11-01&rft.volume=48&rft.issue=6&rft.spage=878&rft.epage=893&rft.pages=878-893&rft.issn=0030-364X&rft.eissn=1526-5463&rft.coden=OPREAI&rft_id=info:doi/10.1287/opre.48.6.878.12399&rft_dat=%3Cjstor_proqu%3E222996%3C/jstor_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=219184701&rft_id=info:pmid/&rft_jstor_id=222996&rfr_iscdi=true |