Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00291-009-0166-7
Title: Component allocation and ordering policy in a multi-component, multi-product assembled to stock system
Authors: Chew, E.P. 
Lee, L.H. 
Lau, Y.L.
Keywords: Component commonality
Infinitesimal perturbation analysis
Inventory
Simulation
Issue Date: Feb-2010
Citation: Chew, E.P., Lee, L.H., Lau, Y.L. (2010-02). Component allocation and ordering policy in a multi-component, multi-product assembled to stock system. OR Spectrum 32 (2) : 293-317. ScholarBank@NUS Repository. https://doi.org/10.1007/s00291-009-0166-7
Abstract: This paper considers a two-echelon assembled-to-stock system, consisting of several components and products, where a periodic review policy is used. Some components are common to several products. We propose a component allocation policy that attempts to minimize the total cost which consists of the holding cost and the shortage cost. This policy takes advantage of the sharing of common components. We use simulation, infinitesimal perturbation analysis and steepest descent algorithm to find the components' order-up-to levels for the proposed policy and then compare its effectiveness with two policies that do not allow the sharing of common components. For the scenarios that we have run, the numerical results show that the proposed policy gives the lowest total cost. In addition, we have show the benefits of risk pooling from common component sharing and the echelon effect under different range of parameters. © Springer-Verlag 2009.
Source Title: OR Spectrum
URI: http://scholarbank.nus.edu.sg/handle/10635/63059
ISSN: 01716468
DOI: 10.1007/s00291-009-0166-7
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

2
checked on Jun 19, 2018

WEB OF SCIENCETM
Citations

2
checked on Jun 12, 2018

Page view(s)

27
checked on May 25, 2018

Google ScholarTM

Check

Altmetric


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