×

Inventory problems with perishable items: fixed lifetimes and backlogging. (English) Zbl 1173.90313

Summary: Our model deals with a single-product and a single-stock location with Poisson demand. The replenishment leadtime from the external supplier is fixed. The lifetime of the product is also fixed, and aging is assumed to begin when the order is placed. When the age of a unit has reached its lifetime, the unit is useless and thus discarded from the system. The replenishment policy is assumed to be an order-up-to \(S\)-policy. Demand that cannot be met immediately is backordered. We consider three different cases where the service requirements are represented by: (1) backorder costs per unit, (2) a service level constraint, (3) backorder costs per unit and time unit. Cases 1 and 2 are solved exactly, while an approximation is developed for case 3. We show how the results from an earlier paper assuming lost sales can be used to solve the considered problems. Our results are compared to the results in a related paper considering \((Q, r)\)-policies.

MSC:

90B05 Inventory, storage, reservoirs
90C15 Stochastic programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Axsäter, S., Inventory Control (2006), Springer: Springer New York · Zbl 1117.90042
[2] Berk, E.; Gürler, Ü., Analysis of the \((Q,r)\) inventory model for perishables with positive lead times and lost sales, Operations Research, 56, 1238-1246 (2008) · Zbl 1167.90311
[3] Berman, O.; Sapna, K. P., Optimal service rates of a service facility with perishable inventory items, Naval Research Logistics, 49, 464-482 (2002) · Zbl 1013.90004
[4] Chiu, H. N., An approximation to the continuous review inventory model with perishable items and leadtimes, European Journal of Operational Research, 87, 93-108 (1995) · Zbl 0914.90098
[5] Gürler, Ü.; Özkaya, Y. B., Analysis of the \((s,S)\) policy for perishables with a random shelf life, IIE Transactions, 40, 759-781 (2008)
[6] Kalpakam, S.; Sapna, K. P., \((S\)−1,S)\) Perishable systems with stochastic leadtimes, Mathematical and Computer Modeling, 21, 95-104 (1995) · Zbl 0822.90048
[7] Kalpakam, S.; Shanthi, S., A perishable inventory system with modified \((S\)−1,S)\) policy and arbitrary processing times, Computers & Operations Research, 28, 453-471 (2001) · Zbl 1080.90503
[8] Lian, Z.; Liu, L., Continuous review perishable inventory systems: models and heuristics, IIE Transactions, 33, 809-822 (2001)
[9] Liu, L., \((s,S)\) Continuous review models for inventory with random lifetimes, Operations Research Letters, 9, 161-167 (1990) · Zbl 0726.90022
[10] Liu, L.; Shi, D. H., An \((s,S)\) model for inventory with exponential lifetimes and renewal demands, Naval Research Logistics, 46, 39-56 (1999) · Zbl 0922.90053
[11] Liu, L.; Yang, T., An \((s,S)\) random lifetime inventory model with a positive leadtime, European Journal of Operational Research, 113, 52-63 (1999) · Zbl 0948.90006
[12] Manuel, P.; Sivakumar, B.; Arivarignan, G., A perishable inventory system with service facilities and retrial customers, Computers & Industrial Engineering, 54, 484-501 (2008)
[13] Nahmias, S., Perishable inventory theory: a review, Operations Research, 30, 680-708 (1982) · Zbl 0486.90033
[14] Palm, C., Analysis of the Erlang traffic formula for busy-signal arrangements, Ericsson Technics, 5, 39-58 (1938)
[15] Schmidt, C. P.; Nahmias, S., \((S\)−1,S)\) Policies for perishable inventory, Management Science, 31, 719-728 (1985) · Zbl 0615.90035
[16] Schultz, C. R., On the optimality of the \((S\)−1,S)\) policy, Naval Research Logistics, 37, 715-723 (1990) · Zbl 0719.90027
[17] Sivakumar, B., A perishable inventory system with retrial demands and a finite population, Journal of Computational and Applied Mathematics, 224, 29-38 (2009) · Zbl 1152.90002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.