[go: up one dir, main page]
Scribd
Upload
313 views14 pages

Hit and Miss Example or Report

The document discusses using probabilistic dynamic programming to determine the optimal lot sizes (reject allowances) for a manufacturer to minimize costs over multiple production runs needed to produce an acceptable item meeting a customer's quality requirements. The manufacturer has a 50% chance of an item being acceptable and can make up to 3 production runs. The objective is to find the policy of lot sizes that minimizes total expected costs considering production, setup, and penalty costs if no acceptable item is produced in 3 runs. Dynamic programming is used to calculate recursively the minimum expected costs for different state (number of acceptable items still needed) and action (lot size) combinations at each stage/run.

Uploaded by

Talen Marzan-Lelis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
313 views14 pages

Hit and Miss Example or Report

The document discusses using probabilistic dynamic programming to determine the optimal lot sizes (reject allowances) for a manufacturer to minimize costs over multiple production runs needed to produce an acceptable item meeting a customer's quality requirements. The manufacturer has a 50% chance of an item being acceptable and can make up to 3 production runs. The objective is to find the policy of lot sizes that minimizes total expected costs considering production, setup, and penalty costs if no acceptable item is produced in 3 runs. Dynamic programming is used to calculate recursively the minimum expected costs for different state (number of acceptable items still needed) and action (lot size) combinations at each stage/run.

Uploaded by

Talen Marzan-Lelis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 14

PROBABILISTIC

DYNAMIC
PROGRAMMING
Rhobert Daniele M. Oa

Determining Reject Allowances


The HIT AND MISS MANUFACTURING COMPANY has received an
order to supply one item of a particular type. However, the
customer has specified such stringent quality requirements that
that the manufacturer may have to produce more than one item
to obtain an item that is acceptable. The number of extra items
produced ina production run is called the reject allowance.
Including a reject allowance is common practice when producing
for a custom order, and it seems advisable in this case.
The manufacturer estimates that each item of this type that is
produced will be acceptable with probability 0.5 and defective
(without possibility of rework) with probability 0.5. Thus, the
number of acceptable items produced in a lot size of L will be a
binomial distribution; i.e., the probability of producing no
acceptable items in such a lot is (0.5)^L

Marginal production costs for this product are estimated to be $100


per item (even if defective), the excess items are worthless. In
addition, a setup cost of $300 must be incurred whenever the
production process is set up for this product, and a completely new
setup at this same cost is required for each subsequent production
run if a lengthy inspection procedure reveals that a completed lot
has not yielded an acceptable item. The manufacturer has time to
make no more that three production runs. If an acceptable item has
not been obtained by the end of the third production run, the cost to
the manufacturer in lost sales income and penalty costs will be
$1,600.

The objective is to determine the policy regarding the lot size


(1+reject allowance) for the required production run(s) that
minimizes total expected cost for the manufacturer.

STAGE

Stage

n = production run n (n = 1,2,3),

Lot Size
Xn

= lot size for stage n,

STATE
State

Sn = number of acceptable items


still needed (1 or 0 ) at the beginning of
stage n.

Stage
Xn

n = production run n (n = 1,2,3),

= lot size for stage n,

State

Sn = number of acceptable items


still needed (1 or 0 ) at the beginning of
stage n.

At

stage 1, state S1 = 1. If at least one


acceptable item is obtained
subsequently, the state changes to Sn =
0, after which no additional costs need
to be incurred.

Fn(Sn , Xn) = total expected cost for stages n


Fn*(Sn) =

min

Xn = 0,1,2,

fn(Sn,Xn)

Marginal production costs for this product are estimated to be $100 per item
(even if defective), the excess items are worthless. In addition, a setup cost
of $300 must be incurred whenever the production process is set up
for this product, and a completely new setup at this same cost is required for
each subsequent production run if a lengthy inspection procedure reveals that
a completed lot has not yielded an acceptable item.

K(Xn) = 0

if Xn = 0

K(Xn) = 3

if Xn > 0

For Sn = 1
Fn(1 , Xn) = K(Xn) + Xn + (0.5)Xn fn+1*(1) + [1-(0.5)Xn ] fn+1*(0)

R.
R.
If an acceptable item has not been obtained by the end of the
Fn(1 , Xn) = K(Xn) + Xn + (0.5)Xn
fn+1*(1)

third production run, the cost to the manufacturer in lost sales


income and penalty costs will be $1,600.

f4*(1) = 16

Recursive relationship for the dynamic programming


calculation:

Fn(1 , Xn) = K(Xn) + Xn + (0.5)Xn


fn+1*(1)

SOLUTION PROCEDURE

Thus,

the optimal policy is to produce


two items on the first production, if none
is acceptable, then produce either two
or three items on the second production
run; if non is acceptable then produce
either three or four items on the third
production run. The total expected cost
for this policy is $675.

You might also like