Process Flexibility: A Distribution-Free Bound on the Performance of K-Chain
New York University (NYU)
New York University (NYU) - Department of Information, Operations, and Management Sciences
August 16, 2013
Process flexibility has been widely applied in many industries as a competitive strategy to improve responsiveness to demand uncertainty. An important flexibility concept is the long chain proposed by Jordan and Graves. The effectiveness of the long chain has been investigated via numerical as well as theoretical analysis for specific probability distributions of the random demand. In this paper, we obtain in closed-form a distribution-free bound on the ratio of the expected sale of the long chain relative to that of full flexibility. Our bound depends only on the mean and standard deviation of the random demand, but compares very well with the bound that uses complete information of the demand distribution. This suggests the robustness of the performance of the long chain under different distributions. We also prove a similar result for k-chain, a more general flexibility structure.
Number of Pages in PDF File: 32
Keywords: Process flexibility, problem of moments, asymptotic analysis, worst-case boundworking papers series
Date posted: August 17, 2013
© 2014 Social Science Electronic Publishing, Inc. All Rights Reserved.
This page was processed by apollo1 in 0.422 seconds