Abstract

We investigate the impact of effective lifetime of items in an age-based control policy for perishable inventories, a so-called (Q, r, T) policy, with positive lead time and fixed lifetime. The exact analysis of this control policy in the presence of a service level constraint is available in the literature under the restriction that the aging process of a batch begins when it is unpacked for consumption, and that at most one order can be outstanding at any time. In this work, we generalize those results to allow for more than one outstanding order and assume that the aging process of a batch starts since the time that it is ordered. Under this aging process, we derive the effective lifetime distribution of batches at the beginning of embedded cycles in an embedded Markov process. We provide the operating characteristic expressions and construct the cost rate function by the renewal reward theorem approach. We develop an exact algorithm by investigating the cost rate and service level constraint structures. The proposed policy considerably dominates its special two-parameter policies, which are time-dependent (Q, T) and stock-dependent (Q, r) policies. Numerical studies demonstrate that the aging process of items significantly influences the inventory policy performance. Moreover, allowing more than one outstanding order in the system reaps considerable cost savings, especially when the lifetime of items is short and the service level is high.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.