Please use this identifier to cite or link to this item: https://doi.org/10.1080/0740817X.2012.676748
Title: Dual-channel component replenishment problem in an assemble-to-order system
Authors: Yao, Z. 
Lee, L.H. 
Chew, E.P. 
Hsu, V.N.
Jaruphongsa, W.
Keywords: Analytical method
Assemble-to-order system
Branch and bound
Component replenishment
Dual channel
Heuristics
Multi-component
Multi-item newsvendor model
Optimal solution procedure
Restricted problem
Issue Date: 2013
Citation: Yao, Z., Lee, L.H., Chew, E.P., Hsu, V.N., Jaruphongsa, W. (2013). Dual-channel component replenishment problem in an assemble-to-order system. IIE Transactions (Institute of Industrial Engineers) 45 (3) : 229-243. ScholarBank@NUS Repository. https://doi.org/10.1080/0740817X.2012.676748
Abstract: This article considers a component inventory problem in an assemble-to-order system where the assemble-to-order manufacturer faces a single-period stochastic demand for a single product created frommultiple components. After the demand is realized, required components that are not available from inventory can be obtained using two sourcing channels that have different prices and lead times. The considered problem is formulated and solved analytically and the structural properties of its optimal solutions are explored. Computational experiments are performed to demonstrate the efficiency of the solution methods and comparisons are made between the performance of assemble-to-order systems with single- and dual-channel procurement approaches. It is also demonstrated that the proposed approach can be extended to the problem that considers multiple sourcing channels for components.
Source Title: IIE Transactions (Institute of Industrial Engineers)
URI: http://scholarbank.nus.edu.sg/handle/10635/63099
ISSN: 0740817X
DOI: 10.1080/0740817X.2012.676748
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.