Optimal spares allocation to an exchangeable-item repair system with tolerable wait
Michael Dreyfuss and
Yahel Giat
European Journal of Operational Research, 2017, vol. 261, issue 2, 584-594
Abstract:
In a multi-location, exchangeable-item repair system with stochastic demand, the expected waiting time and the fill rate measures are oftentimes used as the optimization criteria for the spares allocation problem. These measures, however, do not take into account that customers will tolerate a reasonable delay and therefore, a firm does not incur reputation costs if customers wait less than their tolerable wait. Accordingly, we generalize the expected waiting time and fill rate measures to reflect customer patience. These generalized measures are termed the truncated waiting time and the window fill rate, respectively. We develop efficient algorithms to solve the problem for each of the criteria and demonstrate how incorporating customer patience provides considerable savings and profoundly affects the optimal spares allocation.
Keywords: Inventory; Logistics; Truncated waiting time; Window fill rate; Optimization criteria (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (17)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221717301534
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:261:y:2017:i:2:p:584-594
DOI: 10.1016/j.ejor.2017.02.031
Access Statistics for this article
European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati
More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().