Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and...

41
Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole, a division of Thomson Learning, Inc.
  • date post

    19-Dec-2015
  • Category

    Documents

  • view

    230
  • download

    7

Transcript of Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and...

Page 1: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

Chapter 16

Probabilistic Inventory Models

to accompany

Operations Research: Applications and Algorithms

4th edition

by Wayne L. Winston

Copyright (c) 2004 Brooks/Cole, a division of Thomson Learning, Inc.

Page 2: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

2

Description

No we consider inventory models in which demand over a given time period is uncertain, or random; single period inventory models, where a problem is ended once a single ordering decision has been made; single-period bidding models; version of the EOQ model for uncertain demand that incorporate the important concepts of safety stock and service level; the periodic review (R,S) model, and the ABC inventory classification system.

Page 3: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

3

16.1 Single Period Decision Models In many situations, a decision maker is faced with

the problem of determining the value q for a variable.

After q has been determined, the value d assumed by a random variable D is observed.

Depending on the values of d and q, the decision maker incurs a cost c(d,q). We assume that the person is risk-neutral and wants to choose q to minimize her expected cost.

Since the decision is made only once, we call a model of this type a single-period decision model.

Page 4: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

4

16.2 The Concept of Marginal Analysis

For the single-period model, we now assume that D is an integer-valued discrete random variable with P(D=d)=p(d).

Let E(q) be the decision maker’s expected cost if q is chosen. Then

In most practical applications, E(q) is a convex function of q. Let q* be the value of q that minimizes E(q).

d

qdcdpqE ),()()(

Page 5: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

5

From the graph we see that q* is the smallest value of q for which E(q*+1) – E(q*) ≥ 0.

Thus if E(q) is a convex function of q, we can find the value of q minimizing expected cost by finding the smallest value of q that satisfies inequality.

If E(q) is not a convex function, this argument may not work.

Our approach determines q* by repeatedly computing the effect of adding a marginal unit to the value of q. It is called marginal analysis.

Page 6: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

6

16.3 The News Vendor Problem: Discrete Demand

Organizations often face inventory problems where the following sequence of events occurs:

1. The organization decides how many units to order (q).

2. With probability p(d), a demand if d units occurs.

3. Depending on d and q, a cost c(d,q) is incurred.

Problems that follow this sequence are often called news vendor problems.

We show how marginal analysis can be used to solve news vendor problems when demand is a discrete random variable and c(d,q) has the following form.

Page 7: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

7

c(d,q) = coq + (terms not involving q) (d ≤ q)

c(d,q) = -cuq + (terms not involving q) (d ≥ q+1)

co is the overstocking cost and cu is the understocking cost.

To derive the optimal order quantity via marginal analysis, let E(q) be the expected cost if an order is placed for q units.

Since marginal analysis is applicable, we have just shown that E(q) will be minimized by the smallest value of q satisfying

uo

u

cc

cqF

*)(

Page 8: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

8

16.4 The News Vendor Problem: Continuous Demand

We now consider the news vendor problem when demand D is a continuous random variable having density function f(d).

By modifying our marginal analysis argument it can be shown that the decision maker’s expected cost is minimized by ordering q* units, where q* is the smallest number satisfying

uo

u

cc

cqP

*)(D

Page 9: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

9

The optimal order quantity can be determined by finding the value of q* satisfying

uo

o

uo

u

cc

cqPor

cc

cqP

*)(*)( DD

Page 10: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

10

16.5 Other One-Period Models

Many single-period models in operations research cannot be easily handled by marginal analysis.

In such situations we express the decision maker’s objective function as a function f(q) of the decision variable q.

Then we find a maximum or minimum of f(q) by setting f′(q) = 0.

We illustrate this idea by discussion of a bidding model.

Page 11: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

11

Example 4

Condo Construction Company is bidding on an important construction job.

The job will cost $2 million to complete.

One other company is bidding for the job.

Condo believes that the opponent’s bid is equally likely to be an amount between $2 million and $4 million.

If Condo wants to maximize expected profit, what should its bid be?

Page 12: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

12

Example 4 Solution

Let B = random variable representing bid of Condo’s opponentb = actual bid of Condo’s opponentq = Condo’s bid

If b > q, Condo outbids the opponent and earns a profit of q – 2,000,000.

If b < q, Condo is outbid by the opponent and earns nothing.

Page 13: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

13

Example 4 Solution

Let E(q) be Condo’s expected profit if it bids q. Then

Since f(b) = 1/2,000,000 for 2,000,000 ≤ b ≤ 4,000,000, we obtain

q

qdbbfqdbbfqE

000,000,2

000,000,4)()000,000,2()()0()(

000,000,2

)000,000,4)(000,000,2()(

qqqE

Page 14: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

14

Example 4 Solution

To find the value of q maximizing E(q), we find

Hence, E′(q) =0 for q=3,000,000. We know that E(q) is a concave function of q, and 3,000,000 does indeed maximize E(q).

Hence, Condo should bid $3 million. Condo’s expected profit will be $500,000.

000,000,2

2000,000,6

000,000,2

)000,000,4()000,000,2()(

qqqqE

Page 15: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

15

16.6 The EOQ with Uncertain Demand: The (r,q) and (s, S) Models

This section discusses a modification of the EOQ that is used when lead time is nonzero and the demand during each lead time is random.

Assume all demand can be backlogged and a continuous review model, so that orders may be placed at any time, and we define K = ordering cost

h = holding cost/unit/year

L = lead time for each order

q = quantity ordered each time and order takes place

Page 16: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

16

We also require these definitions: D = random variable representing annual demand

with mean E(D), variance var D, and standard deviation σD

cB = cost incurred for each unit short which does not depend on how long it takes to make up stockout

OHI(t) = on-hand inventory at time t

X = random variable representing demand during lead time We assume that X is a continuous random variable

having density function f(x) and mean variance, and standard deviation of E(X), var X and σL.

Page 17: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

17

We suppose if D is normally distributed, then X will also be normally distributed.

If the length of lead time is independent of the demand per unit time during the lead time, then

E(X) = E(L) E(D) and var X = E(L)(var D) + E(D)2(var L)

We want to choose q and r to minimize the annual expected total cost.

A cycle is defined to be the time interval between any two instants at which an order is received.

Page 18: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

18

Determination of Reorder Point: Back-Ordered cases

The situation in which all demand must eventually be met and no sales are lost is called the back-ordered case, for which we show how to determine the reorder point and order quantity that minimize annual expected cost.

Define TC(q,r) = expected annual cost incurred if each order is for q units and is placed when the reorder point is r. Then TC(q,r) = (expected annual holding cost) +(expected annual ordering cost)+(expected annual cost due to shortages)

Page 19: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

19

Then I(t) = OHI(t) – B(t) yieldsExpected value of I(t) expected value of OHI(t)

Expected value of I(t) during a cycle = ½ [(expected value of I(t) at beginning of cycle) + (expected value of I(t) at end of cycle)]

To determine the expected annual cost due to stockouts or back orders, we must define Br = random variable representing the number of stockouts or back orders during a cycle if the reorder point is r.

Page 20: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

20

We obtain

We could find the values of q and r that minimize the equation above by determining values q* and r* of q and r satisfying

q

KE

q

EEcEr

qhrqTC r )()()(

)(2

),(DDB

X

0*)*,(*)*,(

r

rqTC

q

rqTC

Page 21: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

21

We can use LINGO to determine the values of q and r that exactly satisfy the last equation.

In most cases, however, the value of q* satisfying the equation is very close to the EOQ of

Then we have the reorder point r* and the order quantity for q* for the back-ordered case:

2

1

)(2

h

KE D

2

1

)(2*

h

KEq

D)(

**)(

DX

Ec

hqrP

B

Page 22: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

22

Determination of Reorder Point: Lost Sales Case

The optimal order quantity q* and the reorder point r* for the lost sales case are

The key to the derivation of the above equations is to realize that expected inventory in lost sales case = (expected inventory in back-ordered case) + (expected number of shortages per cycle).

2

1

)(2*

h

KEq

D)(*

**)(

DX

Echq

hqrP

LS

Page 23: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

23

Continuous Review (r, q) Policies

A continuous review inventory policy, in which we order a quantity q whenever our inventory level reaches a reorder level r, is often called and (r,q) policy.

An (r,q) policy is also called a two-bin policy because it can easily be implemented by using two bins to store an item.

Page 24: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

24

Continuous Review (s, S) Policies

Suppose that a demand for more than one unit can arrive at a particular time. Then an order may be triggered when the inventory level is less than r, and our computation of expected inventory at the end and beginning of a cycle is then incorrect.

In such situations, it has been shown that an (s, S) policy is optimal.

To implement an (s, S) policy, we place an order whenever the inventory level is less than or equal to s. The size of the order is sufficient to raise the inventory level to S (assuming zero lead time).

Page 25: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

25

16.7 The EOQ with Uncertain Demand: The Service Level Approach to Determining Safety Stock Level

It is usually very difficult to determine accurately the cost of being one unit short.

Managers often decide to control shortages by meeting a specified service level. There are two measures of service level:

Service Level Measure 1 – SLM1, the expected fraction all demand that is met on time

Service Level Measure 2 – SLM2, the expected number of cycles per year during which a shortage occurs

Page 26: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

26

Determination of Reorder Point and Safety Stock Level for SLM1

For given values of q and r, we have

If X is normally distributed, the determination of E(Br) requires a knowledge of the normal loss function.

q

E

E

qEESLM rr )(

)(

/)()(1 1

BDDB

yearper demand expected

yearper shortages expected

Page 27: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

27

The normal loss function, NL(y), is defined by the fact that σXNL(y) is the expected number of shortages that will occur during a lead time if (1) lead time demand is normally distributed with mean E(X) and standard deviation σX and (2) the reorder point is E(X) +y σX .

LINGO with the @PSL function may be used to computer values of the normal loss function.

Page 28: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

28

Using LINGO to Computer the Reorder Point Level for SLM1

Using the @PSL function in LINGO is a simple matter to computer the reorder point level of SLM1.

Page 29: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

29

Determination of Reorder Point and Safety Stock Level for SLM2

Suppose that a manager wants to hold sufficient safety stock to ensure that an average of s0 cycles per year will result in a stockout.

The reorder point r for SLM2 for continuous lead time demand

and the reorder point for SLM2 for discrete lead time demand, by choosing the smallest value of r satisfying

)()( 0

DX

E

qsrP

)()( 0

DX

E

qsrP

Page 30: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

30

16.8 (R, S) Periodic Review Policy

In this section we will discuss a widely used periodic review policy: the (R, S) policy.

We need to define the concept of on-order inventory level.

The on-order inventory level is simply the sum of on-hand inventory and inventory on order.

Every R units of time, we review the on-hand inventory level and place an order to bring the on-order inventory level up to S.

Page 31: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

31

We define

R = time (in years) between reviews

D = demand (random) during a one-year period

E(D) = mean demand during a one-year period

K = cost of placing an order

J = cost of reviewing inventory level

h = cost of holding one item in inventory for one year

cB = cost per-unit short in the backlogged case (assumed to be independent of the length of time until the order is filled)

L = lead time for each order (assumed constant)

Page 32: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

32

DL+R = demand (random) during a time interval of length L + R

E(DL+R) = mean of DL+R

σ DL+R = standard deviation of DL+R

Through calculations and marginal analysis to determine (for a given R) the value of S that minimizes the sum of annual expected holding and shortage costs will occur for the value of S satisfying

BRLRLB c

RhSPorSPc

Rh

)()(

1DD

Page 33: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

33

Suppose that all shortages result in lost sales, and a cost of cLS (including shortage cost plus lost profit) is incurred for each lost sale.

Then the value of S minimizing the sum of annual expected holding and shortage costs is given by

LSRL cRh

RhSP

)(D

Page 34: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

34

Determination of R

Often the review interval R is set equal to .

This makes the number of orders placed per year equal the number recommended if a simple EOQ model were used to determine the size of orders.

Since each order is accompanied by a review, however, we must set the cost per order to K +J.

This yields

)(DE

EOQ

h

EJKEOQ

)()(2 D

Page 35: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

35

Implementation of and (R, S) System

Retail stores often find an (R, S) policy easy to implement, because the quantity ordered equals the number of sales occurring during the period between reviews.

Page 36: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

36

16.9 The ABC Inventory Classification System

Many companies develop inventory policies for thousands of items. In these cases they can not spend the time to focus on the “optimal” inventory policy for each item.

The ABC classification, devised at General Electric during the 1950s, helps a company identify a small percentage of its items that account for a large percentage of the dollar value of annual sales.

These items are called Type A items.

Page 37: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

37

Since most of our inventory investment is in Type A items, high service levels will result in huge investments in safety stocks.

Hax and Candea recommends that SLM1 be set at on 80-85% for Type A items.

Tight management control of ordering procedures is essential for Type A items.

Also, every effort should be made to lower the lead time needed to one week.

Page 38: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

38

For Type B items, Hax and Candea recommend the SLM1 be set at 95%.

Inventory policies for Type B items can generally be controlled by computer.

For Type C items, a simple two-bin system is usually adequate.

Parameters are reviewed twice a year. Demand for Type C items may be forecasted by simple extrapolation methods.

Page 39: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

39

16.10 Exchange Curves In many situations, it is difficult to estimate

holding and shortage costs accurately.

Exchange curves can be used in such situations to identify “reasonable” inventory policies.

An exchange curve enables us to display graphically the trade-off between annual ordering costs, and average inventory investment.

We define

ci = cost of purchasing each unit of product i

h = cost of holding $1 worth of either product in inventory for one year

Page 40: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

40

Ki = order cost of product i

qi = EOQ for product i

Di = annual demand for product i

Two measures of effectiveness for this (or any other) ordering policy are

AII = average dollar value of inventory

AOC = annual ordering cost

A plot of the points (AOC, AII) associated with each value of h is known as an exchange curve, we see that 2

2221112

1)( cDKcDKAOCAII

Page 41: Chapter 16 Probabilistic Inventory Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004.

41

Exchange Curves for Stockouts Exchange curves can also be used to assess

the trade-offs between average inventory investment (AII) and the expected number of lead time per year resulting in stockouts.

Using more sophisticated techniques, an exchange surface involving three or more quantities can be derived.

An exchange surface makes it easy to identify the trade-offs involved between improving service, increased inventory investment, and increased work load (orders per year).