Inventory control for point-of-use locations in hospitals
Authors
Abstract
Most inventory management systems at hospital departments are characterised by lost sales, periodic reviews with short lead times, and limited storage capacity. We develop two types of exact models that deal with all these characteristics. In a capacity model, the service level is maximised subject to a capacity restriction, and in a service model the required capacity is minimised subject to a service level restriction. We also formulate approximation models applicable for any lost-sales inventory system (cost objective, no lead time restrictions etc). For the capacity model, we develop a simple inventory rule to set the reorder levels and order quantities. Numerical results for this inventory rule show an average deviation of 1% from the optimal service levels. We also embed the single-item models in a multi-item system. Furthermore, we compare the performance of fixed order size replenishment policies and (R, s, S) policies.
Keywords
health serviceinventoryservice levelcapacity limitationsheuristics1. Introduction
The main objective of a hospital is to provide high-quality health care. Sufficient medical items need to be on hand to enable hospital staff to perform their daily work. Typically, medical supplies are stored at many locations in a hospital and in large quantities to prevent stock outs as much as possible. However, hospitals have lack of available storage space (Lapierre and Ruiz, 2007; Little and Coughlan, 2008) and millions of dollars are tied up in inventories that consume on average 20% of net patients revenues and represent the second largest expense after labour (Moon, 2004). Therefore, the available storage capacity should be used efficiently, and it is important to find a balance of the service quality and the desired inventory levels between the different items. The goal of this paper is to develop inventory models which consider the service level as well as the capacity limitations at hospitals. Our main contribution is the development of new solution techniques to support hospital management decisions with regard to inventory control.
Two types of models are proposed to deal with the capacity limitations and the service requirements: a capacity model and a service model. In a capacity model, the objective is to maximise the service level when the storage capacity is limited. This model can be used in a multi-item inventory control system with a storage capacity constraint. In a service model, the required capacity is minimised while satisfying a service constraint instead of having a cost objective. The service model results in the lowest inventory levels within a service level restriction. Consequently, the model will minimise inventory holding costs. We will show that our approximation procedures can be used to minimise costs in Section 8. For a more detailed discussion on models with a service constraint and models with a cost objective we refer to van Houtum and Zijm (2000).
In Section 2 we derive the specific characteristics of the inventory system under study. In Section 3 we state the added value of this research by providing an overview on the literature for hospital and general inventory management. We develop a model for hospital inventory systems in Section 4. Moreover, we present an approach to use this single-item capacity model in a multi-item inventory control system to assign items to the total capacity available at hospitals. In Section 5 we demonstrate and compare the performance of different replenishment policies based on data from a practical case study. Simple and effective closed-form expressions are derived in Section 6 for several performance measures to set the inventory control variables of the replenishment policy. Furthermore, we develop a new heuristic approach in Section 7 to derive near-optimal solutions for the capacity model indicating the reorder level and order quantity. Numerical experiments are performed in Section 8 to show the general applicability and to test the performance of the different procedures and replenishment policies for a wide range of settings. Section 9 presents our conclusions.
2. POU inventory systems in hospitals
We roughly distinguish three types of inventories in hospitals, namely perishable items including medicines and blood (see, eg, Prastacos, 1984; Katsaliaki and Brailsford, 2007), non-disposables (eg, instruments) and disposables (eg, gloves, needles, sutures). Our main focus in this research is on disposable items since this type of products is stored in almost all locations in hospitals and, therefore, more difficult to control.
In the literature two concepts are proposed to improve the performance of health-care supply chains: product standardisation and selecting prime vendors (see, eg, Johnston, 1992). The former concept reduces the number of different items that have to be stocked. Consequently, it reduces the volatility of the demand. The latter concept can reduce lead times and, therefore, the safety stock as well. Besides these tactical and strategical decisions, it is also essential to decide on the time instant to place a new replenishment order (ie, the reorder level) and the corresponding order size for each item on stock at a single POU location. Such operational decisions are the focus in this paper.
Inventory management of disposable items at each POU location can be described as a system where all items are stored in bins. Each bin has a total storage capacity of C(i) units for item i that is used to fulfil demand of medical staff whenever required. If s or less units of an item are available in the bin a signal is given (eg, a nurse puts a bar code of the item on an ordering board). This level s is called the reorder level. These signals are scanned at prespecified time intervals of length R (ie, periodic reviews) that may range from days to weeks. Items are usually ordered in fixed quantities of size Q to provide a transparent and easy-to-understand inventory policy for hospital staff. After L time units the ordered items are resupplied from the higher-level stock point to the specific bins (see Figure 1). In a hospital setting the lead time L is known and relatively short due to the high product availability at nearby higher-level stock points. Therefore, another characteristic for the inventory system at hospitals is that the lead time L is shorter than the length of the review period R (see also Duclos, 1993). This is referred to as fractional lead times.
If a required item is not available in the right quantity at a specific POU location to provide the required health-care service, a substitute product is used or an emergency delivery is performed (eg, from another POU location). The original demand for the item is considered to be lost. Such situations are time costly and should be avoided as much as possible. Therefore, we define the service level as the fraction of demand to be satisfied directly from stock on hand (ie, item fill rate). Note that this definition does not include the fraction of demand that is satisfied due to a substitution or an emergency delivery in case of a stock out.
The characteristics of the relevant literature discussed in this paper: deterministic (det) or stochastic (stoch) demand, excess demand is backordered (back) or lost, lead time is an integral multiple of the review period (L=nR) or fractional (L⩽R), periodic (P) or continuous (C) review, replenishment policy, number of items, capacity limitation, and the objective function
Demand process | Excess demand | Lead time | Review | Policy | Nr. of items | Capacity | Objective | |
---|---|---|---|---|---|---|---|---|
Inventory management for hospitals | ||||||||
det | back | L=nR | P | (R, s, Q) | single | yes | cost | |
stoch | back | — | P | (R, S) | single | no | cost | |
det | back | L=nR | P | (R, s, Q) | multi | yes | cost | |
stoch | back | L=0 | P | (R, s, Q) | multi | no | cost | |
stoch | back | L=0 | P | (R, S) | multi | yes | service | |
General inventory management | ||||||||
stoch | back | L=nR | P | (R, s, Q) | single | no | service | |
stoch | lost | L=nR | C | (s, Q) | single | no | cost | |
stoch | lost | L=nR | C | (s, Q) | single | no | cost | |
stoch | lost | L=nR | C | (s, Q) | single | no | cost | |
stoch | lost | L=nR | P | (R, S) | single | no | cost | |
stoch | lost | — | P | (R, S) | single | no | cost | |
stoch | lost | L=nR | P | (R, S) | multi | yes | cost | |
stoch | lost | L=nR | P | (R, s, S) | single | no | cost | |
stoch | lost | L=nR | P | (R, s, Q) | single | no | cost | |
stoch | lost | L⩽R | P | (R, S) | single | no | cost | |
stoch | lost | L⩽R | P | (R, s, S) | single | no | cost | |
stoch | lost | L=nR | P | (R, S) | single | no | service | |
stoch | lost | L=nR | P | (R, s, S) | single | no | service | |
stoch | lost | — | P | (R, s, S) | single | no | service | |
stoch | lost | L⩽R | P | (R, s, S) | single | no | service | |
stoch | lost | L⩽R | P | (R, S) | single | no | service | |
This paper | stoch | lost | L⩽R | P | (R, s, Q) | multi | yes | service |
3. Literature overview
Hardly any literature is available on replenishment policies for inventory systems in a hospital setting. The literature overview on operation research in health-care settings by Brandeau et al (2004) does not even mention inventory theory. Only a few papers are available about inventory control in a hospital setting. Lapierre and Ruiz (2007) solve a multi-item inventory replenishment problem with storage and manpower capacity restrictions. In their research, demand is assumed to be deterministic and known. They formulate a non-linear mixed-integer problem and solve this with a tabu search metaheuristic. Similar restrictions are considered by Little and Coughlan (2008). The authors propose an optimisation model based on constraint programming to determine the delivery frequency and order sizes. A single-item inventory problem with capacity restrictions is discussed by Vincent and Ranton (1984) for a hospital environment. They extend the basic EOQ formula with capacity restrictions and focus on a cost objective instead of a service requirement. Order costs are also the main focus in Dellaert and Van de Poel (1996), where joint replenishments at a central storage room in a hospital result in cost savings.
Most of the literature on inventory theory cannot be used in a hospital context, since they are more focused on backorder models contrary to lost-sales models (see, eg, Zipkin, 2000). Janssen et al (1998) discuss an (R, s, Q) model with backorders. They develop a closed-form expression to calculate the fill rate for given values of R, s and Q. The authors propose a local search procedure to determine the best value of reorder level s subject to a service level constraint. However, we deal with a lost-sales inventory system in this paper. Much less literature is available about such systems, because of the complexity to model the inventory position.
The first study of the (s, Q) policy in a lost-sales context is considered by Hadley and Whitin (1963) for continuous reviews. The majority of the papers that discuss a continuous review lost-sales inventory system extend these preliminary results. A commonly made assumption in literature is to restrict the number of orders outstanding. The restriction Q>s specifies that at most one order may be outstanding at any time (eg, Johansen and Thorstenson, 1996). Hill (1994) analyses a similar inventory model where two orders may be outstanding at any time (ie, Q⩽s<2Q). Johansen and Thorstenson (2004) are the only authors who do not consider a restriction on the number of outstanding orders. Almost all papers dealing with (s, Q) policies in a continuous review model with lost sales derive steady-state probabilities to compute the expected total costs and propose a policy-iteration algorithm (PIA) to find near-optimal values of the reorder level s and order quantity Q based on a cost objective. A more detailed overview on lost-sales models with continuous reviews can be found in Bijvank and Vis (2011). Lost-sales models with a fixed order size policy and periodic reviews have received less attention. The (R, s, Q) policy is only considered under the assumption that there is never more than one order outstanding (ie, Q>s). Johansen and Hill (2000) propose a PIA to set the values of s and Q for a model with a cost objective.
Order-up-to policies have received more attention for lost-sales inventory systems with periodic reviews. Based on numerical examples it is shown that such policies are not optimal for models with a cost objective in a lost-sales setting (see, eg, Hill, 1999; Hill and Johansen, 2006). Fractional lead times in a lost-sales inventory system with a cost objective are considered by Chiang (2006, 2007). For more information on the cost model, we refer to Hill and Johansen (2006), Bijvank and Johansen (2009), Bijvank and Vis (2011) and the references therein.
When there is a service level restriction, Tijms and Groenevelt (1984) propose a procedure for the (R, s, S) policy to determine the value of reorder level s when the order-up-to level S is known. However, the authors briefly mention a lost-sales setting, and they discuss numerical results for only a backorder model. Bijvank and Vis (2010) compare the (R, s, S) policy to an optimal replenishment policy in case of lost sales for a single-item inventory system with no consideration of capacity. For the (R, S) policy, van Donselaar et al (1996) determine the order-up-to level dynamically for each review period with a myopic approach based on a service level constraint. Consequently, the order-up-to level varies over time. This is not preferred at hospitals (see also Section 2). Sezen (2006) uses simulation to study the service level performance for an order-up-to policy. The author varies the length of the review interval to consider the impact on the service level. However, no solution method is proposed to find optimal order-up-to levels but only insights are provided. Fractional lead times and a service constraint are studied by Kapalka et al (1999) for lost-sales inventory systems with an (R, s, S) policy. A summary of the aforementioned references is provided in Table 1.
With respect to the existing literature on lost-sales models we add four aspects. First, we consider capacity constraints and develop a simple inventory rule to set the inventory control variables for the capacity model that can be implemented in a spreadsheet-based program like Excel. Second, we embed the capacity model in a multi-item inventory system with lost sales. Most models for multi-item inventory systems consider cost savings when replenishments are coordinated over multiple items instead of capacity constraints (see, for instance, Silver et al 1998; Axsäter, 2006). Third, we compare the performance of the (R, s, Q) policy to the (R, s, S) policy in case there is a capacity restriction. Fourth, we derive closed-form expressions to approximate performance measures (eg, fill rate, average costs) for lost-sales inventory systems with either an (R, s, Q) or an (R, s, S) replenishment policy. These expressions can be used in more general settings besides the hospital setting described in Section 2, since there is no assumption on the lead time or on the available capacity.
4. Models
In this section we develop a service model and a capacity model for the inventory control system at a POU location as described in Section 2. Therefore, we decompose the inventory system in single-item models and we embed these models in a multi-item inventory system with a storage capacity constraint. This multi-item model can be used to determine the available capacity for each item in the capacity model.
4.1. Single-item inventory system
We derive a single-item capacity model and a service model for the (R, s, Q) policy with lost sales, fractional lead times and a service level constraint. Kapalka et al (1999) propose a Markov decision model to determine the service level based on the steady-state distribution of the on-hand inventory at a review instant for an (R, s, S) replenishment policy. We use a similar approach in this section to develop our model.
The random variable X_{n+1} only depends on X_{n} and the demand during one review period. Thus X={X_{n}, n⩾0} is a homogeneous, one-dimensional Markov chain with state space {0, 1, …, s+Q}.
The average fill rate is denoted by β=∑_{i}π(i)β(i). The same analysis can be performed for an (R, s, S) policy. Since the order size in this policy is not fixed, the value of Q has to be replaced by S−i in Equation (1) to Equation (3). Kapalka et al (1999) perform a similar analysis for the (R, s, S) policy.
where β̄ is a minimum service level. For the (R, s, S) policy, replace s+Q by S. Note that the restriction in the capacity model can be replaced by s+Q=C to make full use of the available capacity. Consequently, the search space of possible solutions for s and Q is a bounded one-dimensional vector (ie, s∈{0, 1, …, C}). An enumeration procedure over all C+1 values of reorder level s is required to maximise the service level. However, the service model results in an unbounded two-dimensional solution space. How to determine the value of the available capacity C in the capacity model is discussed in the remainder of this section.
4.2. Multi-item inventory system
where E[D^{k}] is the average demand for item k and β_{k} is the expected service level for item k. Note that the service level β_{k} for item k depends on the replenishment policy and the corresponding values of the inventory control variables (see Section 4.1).
The allocation of the limited storage capacity available and the determination of the values for the inventory control variables can be solved simultaneously. We propose a knapsack kind of approach in which a trade-off has to be made between the increase of the service level for an item and a decrease of the remaining capacity available for the other items. The ratio of this service level increment divided by the extra assigned capacity to this item is computed for each item in every iteration. We assign an extra bin to the item with the highest ratio until all capacity is assigned. To compute the increase in the service level, we determine the optimal control values of the replenishment policy and the corresponding service level as discussed in Section 4.1. The solution procedure for the allocation of limited storage capacity among items in a multi-item inventory system is summarised in Algorithm 1. This procedure can be repeated for each POU location. A similar approach can also be used by a hospital manager to decide how much capacity is required and which items should be stored at each of the POU locations based on a service level constraint similar to our service model. To perform such a procedure, line 2 in Algorithm 1 has to be altered to make sure that a predefined service level is satisfied and the lines 4, 7–9 should be removed since there is no capacity constraint TC.
Algorithm 1: Storage capacity allocation
1 set a(k)=0 for all items k;
2 while ∑_{k}TC(k)⩽TCdo
3 foreach item ldo
4 if ∑_{k}TC(k)+BC(l)⩽TCthen
5 - determine optimal values of the inventory control variables for the capacity model of item l where C=(a(l)+1)C(l) (see Section 4.1);
6 - determine the new corresponding service level β′_{l};
7 else
8 β′_{l}=0;
9 end
10 Δβ_{l}=(β′_{l}−β_{l})E[D^{l}]/∑_{k}E[D^{k}];
11 ΔC_{l}=BC(l);
12 Δ_{l}=Δβ_{l}/ΔC_{l};
13 end
14 l^{*}=argmax{Δ_{l}}, a(l^{*})=a(l^{*})+1;
15 end
5. Hospital sample data
In this section we illustrate the performance of the (R, s, Q) policy and the (R, s, S) policy based on the models developed in Section 4.1. The main goal of this section is to apply the capacity model and the service model in practice and to demonstrate how the models can be used to increase the service level.
We observed the (R, s, Q) replenishment policy at the VU University Medical Centre (VUmc) in Amsterdam and at Hospital Amstelland in Amstelveen. In particular, we consider many items and report in detail on a representative example about infusion liquids at three POU locations (paediatrics, intensive care and obstetrics).
The parameter values corresponding to the current situation for infusion liquid at different POU locations in Hospital Amstelland
POU location | L | R | μ_{L} | μ_{R} | C | β (%) |
---|---|---|---|---|---|---|
Paediatrics | 4 h | 3 days | 0.2 | 4.1 | 5 | 89.9 |
Intensive care | 4 h | 3 days | 1.0 | 18.4 | 40 | 97.7 |
Obstetrics | 4 h | 1 week | 1.4 | 58.9 | 100 | 87.8 |
The fill rate β and order frequency OF for the optimal (R, s, Q) policy (denoted by s*) and the (R, s, S) policy with a similar order frequency (denoted by s̄)
POU location | s* | β_{(R, s, Q)}(s*) (%) | OF_{(R, s, Q)}(s*) | s̄ | β_{(R, s, S)}(s̄) (%) | OF_{(R, s, S)}(s̄) |
---|---|---|---|---|---|---|
Paediatrics | 1 | 74.2 | 1.32 | 2 | 83.9 | 1.26 |
Intensive care | 19 | 98.7 | 1.16 | 25 | 99.9 | 1.18 |
Obstetrics | 40 | 97.7 | 1.04 | 53 | 99.6 | 1.05 |
- 1
use the alternative (R, s, S) replenishment policy with the same order frequency,
- 2
shorten the length of the review period,
- 3
increase the available capacity.
The results for the capacity model when the review period length is shortened by one day, and the results for the service model
POU location | Shorten R with 1 day | β̄=95% | β̄=98% | ||||||
---|---|---|---|---|---|---|---|---|---|
s* | β_{(R, s, Q)}(s*) (%) | OF_{(R, s, Q)}(s*) | s* | Q* | C* | s* | Q* | C* | |
Paediatrics | 1 | 85.8 | 1.28 | 5 | 5 | 10 | 6 | 6 | 12 |
Intensive care | 19 | 99.9 | 1.39 | 14 | 19 | 33 | 18 | 20 | 38 |
Obstetrics | 40 | 99.1 | 1.06 | 26 | 58 | 84 | 43 | 60 | 103 |
6. Approximation procedure
In this section we propose an approximation procedure in which closed-form expressions are derived for performance measures of interest. Such expressions are much easier to implement in practical applications compared to our Markov models, and large computation times are avoided to set the inventory control variables. Moreover, the expressions can be used for any lost-sales inventory system (even when there is a cost objective). No assumptions are imposed on the lead time or the available capacity. However, we make the assumption that at most one order is outstanding at any time. Such assumptions are common in the literature for lost-sales inventory models (see Section 3). This assumption is always satisfied when the lead time is fractional, otherwise we impose the restriction Q>s or S−s>s on the (R, s, Q) or (R, s, S) policy, respectively. Furthermore, our approximation procedure can be used for different types of replenishment policies.
Note that these expressions are independent of the replenishment policy. The approximate average inventory level just after order delivery is denoted by IL^{+} and does depend on the replenishment policy. For the (R, s, Q) policy IL^{+}=IL^{−}+Q, whereas for an (R, s, S) policy IL^{+}=IL^{−}+S−[s−μ_{u}+ELS_{u}], where ELS_{u} is the expected lost sales during the waiting time for a new order placement after the inventory position has reached reorder level s similar to Equation (8). Furthermore, the average inventory level can be approximated by IL=(IL^{+}+IL^{−})/2.
Note that Equation (8) assumes that the inventory position after ordering exceeds reorder level s. This is satisfied in case Q>s or S−s>s. However, when L⩽R, we do not impose restrictions on these inventory control variables, and we have to correct Equation (8) for the case that μ_{R}>Q and Q⩽s. In this special case the on-hand inventory level before ordering is likely to be zero, and the length of a replenishment cycle is one review period. Therefore, Equation (8) becomes ELS=μ_{R}−Q. No correction is required for the (R, s, S) policy, since the inventory position after ordering equals S>s.
The approximations of Equations (9) and (10) can be used to formulate the capacity model and service model as non-linear integer models to find optimal values of s and Q, which can be solved with standard software packages or spreadsheet-based programs like Excel. Therefore, we show in Section 8 that the approximation models derived in this section are appealing to be used in real-world applications and that they can be extended easily for models with a cost objective in other settings, such as a retail environment.
7. Inventory rule
The goal of this section is to develop a heuristic inventory rule for the capacity model with an (R, s, Q) replenishment policy that can easily be understood by hospital staff to decide upon the reorder level and the order size. This inventory rule can also be used in the multi-item model of Section 4.2.
The inventory rule consists of several tests. First, we check if the capacity C is sufficient to satisfy the demand. If the capacity is restrictive, we need to check whether it is likely that this restriction results in out-of-stock occurrences. Therefore, we examine if the reorder level s could be sufficient to be used as safety stock in order to fulfil demand until the next delivery. If this seems to be sufficient, we can determine the value of s such that stock outs are minimised. Otherwise, we need to find a balance between the reorder level and the order quantity.
The capacity is not restrictive when the order quantity is at least the average amount that is asked for during a review period, that is Q⩾μ_{R}. Another characteristic for this situation is that when no order is placed (ie, inventory level larger than s) the remaining inventory is sufficient to fulfil the demand until the next possible order delivery (ie, the demand until the next review and order delivery), or s+1⩾μ_{R}+μ_{L}. Since s+Q=C, the capacity is not restrictive if C+1⩾2μ_{R}+μ_{L}. Therefore, we can set s∈[μ_{R}+μ_{L}−1;C−μ_{R}] to obtain high service levels. We have chosen to set the value of s equal to the middle of this interval.
- 1
If C+1⩾2μ_{R}+μ_{L}, we set s equal to (C+μ_{L})/2 rounded to the nearest integer. Otherwise go to step 2.
- 2
If (2μ_{R}−μ_{R−L}−C)/(√μ_{R−L})⩽−2, we set s equal to C−μ_{R} rounded to the nearest integer. Otherwise go to step 3.
- 3
We set s equal to 1/2{C−μ_{R−L}+2√μ_{R−L}} rounded to the nearest integer.
In all situations Q=C−s. Note, when μ_{R−L}=0 the second test should be 2μ_{R}⩽C since D_{R−L}=0 and Equation (13) specifies Q⩽s.
The inventory rule can be implemented with the use of a simple spreadsheet program and is, therefore, very appealing to be applied in many hospitals. When we apply this inventory rule to the data of Section 5 on infusion liquid, we obtain the following results for reorder level s: for paediatrics 3, for intensive care 20 and for obstetrics 41. When we compare these results to the optimal values in Table 3, we conclude that the results are very close.
8. Numerical results
The goal of this section is to illustrate the performance of the approximation procedure (Section 6) and the inventory rule (Section 7). Furthermore, we include a comparison of the (R, s, Q) policy and the (R, s, S) policy similar to the case study (Section 5). In order to test the performance for a wide range of settings that correspond to the characteristics of Section 2, we specify test instances in which the average demand in a review period equals 5 to 30 units (with steps of 5 units), while the lead time varies between 0.125 and one times the review period length. In order to test all three situations of the inventory rule, the capacity ranges from μ_{R} to 3μ_{R} with steps of 0.5μ_{R}. This results in 240 test instances for the capacity model. In the service model, there is no capacity limitation but a minimum service level β̄ is specified (see Section 4), where β̄ varies from 90 to 98%. In the final setting we demonstrate the performance of the approximation procedure in more general settings than Section 2. Therefore, we consider a cost objective and a lead time equal to two review periods.
8.1. Capacity model
The average fill rate for using the (R, s, Q) policy with s=s* and the increase and decrease of the service level for using the (R, s, S) policy with s=s̄ and the (R, s, Q) policy with s=ŝ respectively
μ_{R} | C | β_{(R, s, Q)}(s*) (%) | Δβ(s̄, s*) (%) | Δβ(s*, ŝ_{1}) (%) | Δβ(s*, ŝ_{2}) (%) |
---|---|---|---|---|---|
5 | 5 | 52.26 | 8.07 | 0.36 | 10.02 |
5 | 8 | 74.35 | 9.24 | 0.78 | 1.64 |
5 | 10 | 83.65 | 8.29 | 1.65 | 0.29 |
5 | 13 | 92.98 | 4.67 | 1.87 | 0.29 |
5 | 15 | 96.54 | 2.49 | 3.09 | 0.21 |
10 | 10 | 56.90 | 9.43 | 0.00 | 3.67 |
10 | 15 | 75.27 | 9.58 | 0.27 | 1.05 |
10 | 20 | 87.68 | 7.09 | 0.70 | 1.05 |
10 | 25 | 94.97 | 3.84 | 2.00 | 0.39 |
10 | 30 | 98.45 | 1.35 | 2.29 | 0.22 |
15 | 15 | 57.90 | 2.71 | 1.05 | 2.51 |
15 | 23 | 78.86 | 8.67 | 0.27 | 0.27 |
15 | 30 | 89.67 | 6.40 | 0.90 | 1.52 |
15 | 38 | 96.55 | 2.85 | 1.59 | 0.22 |
15 | 45 | 99.07 | 0.84 | 1.82 | 0.19 |
20 | 20 | 59.88 | 1.23 | 0.00 | 1.21 |
20 | 30 | 79.48 | 8.28 | 0.60 | 0.04 |
20 | 40 | 90.96 | 6.18 | 0.99 | 1.85 |
20 | 50 | 97.00 | 2.50 | 1.43 | 0.29 |
20 | 60 | 99.36 | 0.59 | 1.52 | 0.15 |
25 | 25 | 60.37 | 8.30 | 0.82 | 1.39 |
25 | 38 | 81.39 | 7.24 | 0.27 | 0.07 |
25 | 50 | 91.93 | 5.48 | 1.38 | 2.13 |
25 | 63 | 97.60 | 2.08 | 1.24 | 0.17 |
25 | 75 | 99.52 | 0.45 | 1.31 | 0.15 |
30 | 30 | 61.21 | 0.73 | 0.00 | 0.62 |
30 | 45 | 81.65 | 7.19 | 0.23 | 0.18 |
30 | 60 | 92.60 | 5.02 | 1.46 | 2.28 |
30 | 75 | 97.80 | 1.89 | 1.02 | 0.24 |
30 | 90 | 99.62 | 0.35 | 1.15 | 0.13 |
Based on the results of Table 5 we conclude that the fill rate can increase significantly (about 5%) when the (R, s, S) policy is applied compared to the (R, s, Q) policy. However, when the service level is high, the difference between the policies is less. The approximation procedure and the inventory rule are very effective to find good values for the reorder level in all situations. Only when the capacity is equal to the average demand in a review period for a slow moving item the heuristic rule performs badly. However, such situations should be avoided by hospitals at all times, since the average fill rate is below 60% in those situations. In general we conclude that the approximation procedure and the inventory rule perform on average within 1–2% from the optimal service level.
8.2. Service model
The minimal required capacity for the (R, s, Q) policy to satisfy the service level constraint β̄ for the exact service model (C*), and the capacity increase when the approximate service model is used
μ_{R} | β̄=90% | β̄=95% | β̄=98% | ||||||
---|---|---|---|---|---|---|---|---|---|
C* | |Ĉ−C*| | |Ĉ−C*|/C* (%) | C* | |Ĉ−C*| | |Ĉ−C*|/C* (%) | C* | |Ĉ−C*| | |Ĉ−C*|/C* (%) | |
5 | 12.4 | 0.4 | 3.35 | 14.3 | 1.0 | 7.12 | 16.5 | 2.0 | 12.38 |
10 | 21.4 | 1.1 | 5.20 | 24.9 | 0.5 | 2.02 | 28.6 | 2.1 | 7.67 |
15 | 30.4 | 1.6 | 5.26 | 35.1 | 1.0 | 2.89 | 40.0 | 1.4 | 3.61 |
20 | 38.5 | 4.1 | 10.65 | 45.5 | 1.4 | 2.91 | 51.8 | 1.1 | 2.29 |
25 | 46.5 | 5.8 | 12.45 | 54.8 | 2.6 | 4.78 | 63.0 | 0.6 | 1.04 |
30 | 54.5 | 8.1 | 15.05 | 64.1 | 3.9 | 6.00 | 74.1 | 0.6 | 0.82 |
8.3. General setting
We demonstrate the performance of the approximation procedure of Section 6 for more general inventory systems than described in Section 2. In particular we consider systems with a lead time equal to two review periods and a cost objective with holding cost h=1 per unit time and fixed order cost K=25, 50, 100. Furthermore, demand follows a Poisson process with mean μ_{R}=5 and a service level restriction β̄=75%, 80%, 85%, 90%, 95%, 98%.
The performance of the approximation procedure for the (R, s, Q) policy and the (R, s, S) policy in more general inventory settings
β̄(%) | K | (R, s, Q) policy | (R, s, S) policy | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s*, Q* | C(s*, Q*) | β(s*, Q*) (%) | ŝ_{1}, Q̂_{1} | C(ŝ_{1}, Q̂_{1}) | β(ŝ_{1}, Q̂_{1}) (%) | s̄, S̄ | C(s̄, S̄) | β(s̄, S̄) (%) | ŝ_{2}, Ŝ_{2} | C(ŝ_{2}, Ŝ_{2}) | β(ŝ_{2}, Ŝ_{2}) (%) | ||
75 | 25 | 7,17 | 12.37 | 75.28 | 8,15 | 12.58 | 76.26 | 7,22 | 12.56 | 75.76 | 8,20 | 12.63 | 75.77 |
75 | 50 | 5,23 | 17.25 | 75.38 | 6,20 | 17.36 | 75.38 | 5,26 | 17.36 | 75.63 | 6,24 | 17.48 | 75.75 |
75 | 100 | 2,32 | 24.19 | 75.29 | 3,29 | 24.29 | 75.32 | 1,35 | 24.26 | 75.16 | 4,28 | 24.71 | 75.45 |
80 | 25 | 9,16 | 13.42 | 80.74 | 9,16 | 13.42 | 80.74 | 9,22 | 13.46 | 80.39 | 9,23 | 13.61 | 81.29 |
80 | 50 | 7,23 | 18.47 | 80.48 | 8,19 | 18.73 | 80.30 | 7,27 | 18.44 | 80.10 | 8,25 | 18.82 | 80.68 |
80 | 100 | 5,31 | 25.87 | 80.49 | 6,27 | 26.21 | 80.52 | 5,33 | 25.81 | 80.14 | 6,31 | 26.28 | 80.75 |
85 | 25 | 10,18 | 14.51 | 85.50 | 10,18 | 14.51 | 85.50 | 10,25 | 14.50 | 85.27 | 11,23 | 14.75 | 85.65 |
85 | 50 | 9,22 | 19.75 | 85.24 | 9,22 | 19.75 | 85.24 | 9,29 | 19.88 | 85.52 | 9,29 | 19.88 | 85.52 |
85 | 100 | 7,32 | 27.42 | 85.15 | 7,32 | 27.42 | 85.15 | 7,37 | 27.54 | 85.33 | 7,37 | 27.54 | 85.33 |
90 | 25 | 12,16 | 15.91 | 90.37 | 12,17 | 16.04 | 90.84 | 12,26 | 15.92 | 90.34 | 12,26 | 15.92 | 90.34 |
90 | 50 | 11,22 | 21.43 | 90.36 | 11,22 | 21.43 | 90.36 | 11,30 | 21.43 | 90.14 | 11,31 | 21.51 | 90.55 |
90 | 100 | 9,35 | 29.40 | 90.18 | 10,29 | 29.67 | 90.53 | 9,41 | 29.36 | 90.05 | 10,36 | 29.71 | 90.38 |
95 | 25 | 14,18 | 18.01 | 95.32 | 14,17 | 17.79 | 94.93 | 14,30 | 18.02 | 95.32 | 14,29 | 17.82 | 94.98 |
95 | 50 | 13,25 | 23.58 | 95.10 | 13,25 | 23.58 | 95.10 | 13,36 | 23.65 | 95.19 | 13,35 | 23.51 | 95.00 |
95 | 100 | 12,34 | 31.82 | 95.06 | 12,34 | 31.82 | 95.06 | 12,44 | 31.89 | 95.13 | 12,44 | 31.89 | 95.13 |
98 | 25 | 16,20 | 20.28 | 98.01 | 16,19 | 20.05 | 97.88 | 16,34 | 20.30 | 98.02 | 16,33 | 20.08 | 97.90 |
98 | 50 | 16,22 | 26.29 | 98.15 | 15,29 | 26.18 | 97.89 | 16,35 | 26.24 | 98.11 | 16,35 | 26.24 | 98.11 |
98 | 100 | 15,31 | 34.56 | 98.02 | 15,31 | 34.56 | 98.02 | 15,44 | 34.54 | 98.05 | 15,44 | 34.54 | 98.05 |
9. Conclusion
The inventory replenishment system at POU locations in hospitals can be classified as a lost-sales inventory system where the lead time is shorter than the length of a review period and the focus is on service levels. Another characteristic of hospital inventory management is the lack of available storage capacity. We developed capacity and service models for such inventory systems and compared their performances for (R, s, Q) policies and (R, s, S) policies. Both types of replenishment policies are common in hospitals. The fixed order size policy results in a more insightful replenishment process for hospitals with the use of bar codes. However, the (R, s, S) policy uses the capacity more efficiently. If inventory levels are monitored automatically (for instance, when RFID-chips are used) such policies are recommended. However, both replenishment policies perform equally well when the service level is rather high.
We also derived closed-form expressions that approximate performance measures (like the service level) in order to set the inventory control variables. We demonstrated that this approximation procedure can also be used in more general settings other than a hospital inventory system, including a cost objective. The procedure performs very good when the average order size is larger than 1.5 times the average demand in a review period. Furthermore, we developed a simple inventory rule that finds near-optimal values for the reorder levels and order quantities for the capacity model. This inventory rule can easily be embedded in multi-item algorithms that assign items to the available capacity at different POU locations. It can also be used to determine the required capacity.
One possible aspect for future research is the influence that substitution products have on the service level in case of a stock out. Another interesting aspect to investigate would be the interaction of the inventory control between the POU locations and the higher-level stock points like the central storage room. Especially how to set the lead time and the review period length, since they influence the performance of the POU location but they are typically determined by the supplier (ie, the higher-level stock point).
Acknowledgements
The authors would like to thank VU University Medical Centre and Hospital Amstelland for their collaboration and especially Ms L. Roos (replenishment department, Hospital Amstelland) for collecting the data.