Note--Optimal Component Acquisition for a Single-Product, Single-Demand Assemble-to-Order Problem with Expediting
We consider a component acquisition problem for a contract manufacturer who faces a one-time stochastic demand for a single product consisting of a number of components. Components can be ordered early at normal prices before the demand is revealed, or they can be replenished later at higher prices...
Gespeichert in:
| Veröffentlicht in: | Manufacturing & service operations management 2009-04, Vol.11 (2), p.229-236 |
|---|---|
| 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 | 236 |
|---|---|
| container_issue | 2 |
| container_start_page | 229 |
| container_title | Manufacturing & service operations management |
| container_volume | 11 |
| creator | Fu, Ke Hsu, Vernon N Lee, Chung-Yee |
| description | We consider a component acquisition problem for a contract manufacturer who faces a one-time stochastic demand for a single product consisting of a number of components. Components can be ordered early at normal prices before the demand is revealed, or they can be replenished later at higher prices due to expediting. In addition, the customer pays a price for the final product that is nonincreasing in the delivery lead time to discourage late delivery. We propose a cost-minimization model and develop an efficient polynomial time algorithm to solve the problem. |
| doi_str_mv | 10.1287/msom.1070.0202 |
| format | Article |
| fullrecord | <record><control><sourceid>highwire_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1287_msom_1070_0202</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>msom_11_2_229</sourcerecordid><originalsourceid>FETCH-LOGICAL-c289t-85b23232337ad85e674266b7aac94af42299dcecfaa7f6df45b9fe12481abf483</originalsourceid><addsrcrecordid>eNqFUEtPAyEY3BhNrNWrZy7eZAWWfR2b-k5jTdQzYXehxZRlC9Tafy_btV4N-ZhvkpkhTBRdYhRjUuQ32hkdY5SjGBFEjqIRTkkGU1oWx_s9gTTD9DQ6c-4TIYQLREbR-sV4AeG880rzFZga3ZlWtB5M6vVGOeWVaYE0FnDwptrFSsBXa5pN7a8P_FZo3jZg4pzQVeDewLlthAVBGLgGW-WX4O67E01Iaxfn0YnkKycufnEcfdzfvU8f4Wz-8DSdzGBNitLDIq1I0p8k502RiiynJMuqnPO6pFxSQsqyqUUtOc9l1kiaVqUUmNAC80rSIhlH8ZBbW-OcFZJ1NvzR7hhGrC-M9YWxvjDWFxYMz4PBik7Uf2rVamP30i-WcIzDtQtDECoDqH4N0_VISkaSjC29DmFwCFOt7O3_P3416JdqsdwqK9jBOAgxIyzkJz9o4ZXp</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Note--Optimal Component Acquisition for a Single-Product, Single-Demand Assemble-to-Order Problem with Expediting</title><source>RePEc</source><source>INFORMS PubsOnLine</source><source>Business Source Complete</source><creator>Fu, Ke ; Hsu, Vernon N ; Lee, Chung-Yee</creator><creatorcontrib>Fu, Ke ; Hsu, Vernon N ; Lee, Chung-Yee</creatorcontrib><description>We consider a component acquisition problem for a contract manufacturer who faces a one-time stochastic demand for a single product consisting of a number of components. Components can be ordered early at normal prices before the demand is revealed, or they can be replenished later at higher prices due to expediting. In addition, the customer pays a price for the final product that is nonincreasing in the delivery lead time to discourage late delivery. We propose a cost-minimization model and develop an efficient polynomial time algorithm to solve the problem.</description><identifier>ISSN: 1523-4614</identifier><identifier>EISSN: 1526-5498</identifier><identifier>DOI: 10.1287/msom.1070.0202</identifier><language>eng</language><publisher>INFORMS</publisher><subject>assemble-to-order systems ; component supply lead times ; expediting</subject><ispartof>Manufacturing & service operations management, 2009-04, Vol.11 (2), p.229-236</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c289t-85b23232337ad85e674266b7aac94af42299dcecfaa7f6df45b9fe12481abf483</citedby><cites>FETCH-LOGICAL-c289t-85b23232337ad85e674266b7aac94af42299dcecfaa7f6df45b9fe12481abf483</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/msom.1070.0202$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,776,780,3678,3993,27903,27904,62592</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/inmormsom/v_3a11_3ay_3a2009_3ai_3a2_3ap_3a229-236.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Fu, Ke</creatorcontrib><creatorcontrib>Hsu, Vernon N</creatorcontrib><creatorcontrib>Lee, Chung-Yee</creatorcontrib><title>Note--Optimal Component Acquisition for a Single-Product, Single-Demand Assemble-to-Order Problem with Expediting</title><title>Manufacturing & service operations management</title><description>We consider a component acquisition problem for a contract manufacturer who faces a one-time stochastic demand for a single product consisting of a number of components. Components can be ordered early at normal prices before the demand is revealed, or they can be replenished later at higher prices due to expediting. In addition, the customer pays a price for the final product that is nonincreasing in the delivery lead time to discourage late delivery. We propose a cost-minimization model and develop an efficient polynomial time algorithm to solve the problem.</description><subject>assemble-to-order systems</subject><subject>component supply lead times</subject><subject>expediting</subject><issn>1523-4614</issn><issn>1526-5498</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFUEtPAyEY3BhNrNWrZy7eZAWWfR2b-k5jTdQzYXehxZRlC9Tafy_btV4N-ZhvkpkhTBRdYhRjUuQ32hkdY5SjGBFEjqIRTkkGU1oWx_s9gTTD9DQ6c-4TIYQLREbR-sV4AeG880rzFZga3ZlWtB5M6vVGOeWVaYE0FnDwptrFSsBXa5pN7a8P_FZo3jZg4pzQVeDewLlthAVBGLgGW-WX4O67E01Iaxfn0YnkKycufnEcfdzfvU8f4Wz-8DSdzGBNitLDIq1I0p8k502RiiynJMuqnPO6pFxSQsqyqUUtOc9l1kiaVqUUmNAC80rSIhlH8ZBbW-OcFZJ1NvzR7hhGrC-M9YWxvjDWFxYMz4PBik7Uf2rVamP30i-WcIzDtQtDECoDqH4N0_VISkaSjC29DmFwCFOt7O3_P3416JdqsdwqK9jBOAgxIyzkJz9o4ZXp</recordid><startdate>200904</startdate><enddate>200904</enddate><creator>Fu, Ke</creator><creator>Hsu, Vernon N</creator><creator>Lee, Chung-Yee</creator><general>INFORMS</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>200904</creationdate><title>Note--Optimal Component Acquisition for a Single-Product, Single-Demand Assemble-to-Order Problem with Expediting</title><author>Fu, Ke ; Hsu, Vernon N ; Lee, Chung-Yee</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c289t-85b23232337ad85e674266b7aac94af42299dcecfaa7f6df45b9fe12481abf483</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>assemble-to-order systems</topic><topic>component supply lead times</topic><topic>expediting</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fu, Ke</creatorcontrib><creatorcontrib>Hsu, Vernon N</creatorcontrib><creatorcontrib>Lee, Chung-Yee</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><jtitle>Manufacturing & service operations management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fu, Ke</au><au>Hsu, Vernon N</au><au>Lee, Chung-Yee</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Note--Optimal Component Acquisition for a Single-Product, Single-Demand Assemble-to-Order Problem with Expediting</atitle><jtitle>Manufacturing & service operations management</jtitle><date>2009-04</date><risdate>2009</risdate><volume>11</volume><issue>2</issue><spage>229</spage><epage>236</epage><pages>229-236</pages><issn>1523-4614</issn><eissn>1526-5498</eissn><abstract>We consider a component acquisition problem for a contract manufacturer who faces a one-time stochastic demand for a single product consisting of a number of components. Components can be ordered early at normal prices before the demand is revealed, or they can be replenished later at higher prices due to expediting. In addition, the customer pays a price for the final product that is nonincreasing in the delivery lead time to discourage late delivery. We propose a cost-minimization model and develop an efficient polynomial time algorithm to solve the problem.</abstract><pub>INFORMS</pub><doi>10.1287/msom.1070.0202</doi><tpages>8</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1523-4614 |
| ispartof | Manufacturing & service operations management, 2009-04, Vol.11 (2), p.229-236 |
| issn | 1523-4614 1526-5498 |
| language | eng |
| recordid | cdi_crossref_primary_10_1287_msom_1070_0202 |
| source | RePEc; INFORMS PubsOnLine; Business Source Complete |
| subjects | assemble-to-order systems component supply lead times expediting |
| title | Note--Optimal Component Acquisition for a Single-Product, Single-Demand Assemble-to-Order Problem 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-01-25T08%3A13%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-highwire_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Note--Optimal%20Component%20Acquisition%20for%20a%20Single-Product,%20Single-Demand%20Assemble-to-Order%20Problem%20with%20Expediting&rft.jtitle=Manufacturing%20&%20service%20operations%20management&rft.au=Fu,%20Ke&rft.date=2009-04&rft.volume=11&rft.issue=2&rft.spage=229&rft.epage=236&rft.pages=229-236&rft.issn=1523-4614&rft.eissn=1526-5498&rft_id=info:doi/10.1287/msom.1070.0202&rft_dat=%3Chighwire_cross%3Emsom_11_2_229%3C/highwire_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |