25
Optimal Inventory Policies for Assembly Systems under Random Demands Kaj Rosling Presented by: Shobhit Gupta, Operations Research Center This summary presentation is based on: Rosling, K. “Optimal Inventory Policies for Assembly Systems Under Random Demand.” Operations Research 43 (6), 1989.

Optimal Inventory Policies For Assembly Systems Under Random Demands Assemble To Order System Shobhit Gupta

Embed Size (px)

DESCRIPTION

Optimal Inventory Policies For Assembly Systems Under Random Demands Assemble To Order System Shobhit Gupta

Citation preview

Page 1: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Optimal Inventory Policies for Assembly Systems under

Random DemandsKaj Rosling

Presented by:Shobhit Gupta, Operations Research

Center

This summary presentation is based on: Rosling, K. “Optimal Inventory Policies for Assembly Systems Under Random Demand.” Operations Research 43 (6), 1989.

Page 2: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Main Result• Remodel an assembly system as a series

system

• Simple re-order policies are optimal

(See Figure 1 on page 566 of the Rosling paper)

(See Figure 2 on page 571 of the Rosling paper)

Page 3: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Main Result• Assembly system:

- Ordered amounts available after a fixed lead time- Random customer demands only for the end product- Assumptions on cost parameters

• Under assumptions and restriction on initial stock levels, assembly system can be treated as a series system

• Optimal inventory policy – can be calculated by approach in Clark and Scarf’s paper (1960)*

*Clark, A.J. and Herbert Scarf. “Optimal Policies for a Multi-echelon InventoryProblem.” Management Science 6 (1960): 475-90.

Page 4: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Relevant Literature• Clark and Scarf (1960) – derive optimal ordering policy

for pure series system• Fukuda (1961) – include disposal of items in stock• Federgruen and Zipkin (1984) – generalize Clark and

Scarf approach to stationary infinite horizon case

Page 5: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Model• N items (components, subassemblies, the end item)• Each non-end item has exactly one successor

- product networks forms a tree rooted in the end item• Exactly one unit of each item required for the end item• Notation:

= unique immediate successor of item i=1…N;

= the set of all successors of item i

= the set of immediate predecessors of item i

= the set of all predecessors of item I

= number of periods (lead-time) for assembly (or delivery) of item i

)(is 0)1( =s)(iA)(iP)(iB

il

Page 6: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Model

• At the beginning of a time period:1. Outstanding orders arrive and new ordering

decisions made2. Old backlogs fulfilled and customer

demands occur (for the end period)3. Backlog and inventory holding costs

incurred

Page 7: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Notation= iid demand in period t for the end item with density and

distribution

= , expected value of

= echelon inventory position of item i in period t before ordering decision are made ( = inventory on hand + units in assembly/order - units backlogged)

= echelon inventory position of item i in period t after ordering decisions are made;

= amount ordered for item i in period t;arrives after periods

itX][ tE ξ tξ

itY

λ

itit XY ≥

itit XY −il

)(⋅φ)(⋅Φ

Page 8: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Notation: contd..

• = echelon inventory on hand of item i in period t before ordering decisions are made but after assembles arrive

=

• cannot order more than at hand(no intermediate shortage)

litX

∑ −

−=− −1

,t

ltk kltiii

Y ξ

)( if kPiXY litkt ∈≤

Page 9: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Model: Cost parameters= unit installation holding cost per period of item i = unit echelon holding cost per period of item i

= unit backlogging cost per period of the end item= period discount factor

• Cost in period t

cost gBacklogginitem/ endfor cost Holding

iH

ih

∑ ∈−=

)(iPk kii HHhpα 10 ≤< α

),0(Max),0(Max)( 111)(2

lttt

lt

ltis

lit

N

ii XpXHXXH −⋅+−⋅+−∑

=

ξξ

Cost Holdingon Installati

Page 10: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Model: Cost

• Alternate Formulation:

• Using • Total Expected Cost over an infinite horizon:

(see equation 1 on page 567)

: convolution of over periods)(11 ⋅Φ +l )(⋅Φ )1( 1 +l

∑ +

=++ −=− i

ii

lt

s sitltl

lti YX1, ξξ

(see page 567 of Rosling paper, left hand column)

Page 11: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Long-Run Inventory Position• : total lead-time for item i and all its

successors

• (See page 567, part 2 “Long-Run Inventory Position)

∑ ∈+=

)(iAk kii llMiM

Page 12: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Long-Run Balance

• Assembly system is in long-run balance in period t iff for i=1,..,N-1

• Inventory positions equally close to the end item increase with total lead-time

• Satisfied trivially if

1,...,1for ,1 −=≤ −+

−i

Mti

Mit MXX µµµ

)()1( iPi ∈+

Page 13: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Assumptions on Cost parameters

•– All echelon holding costs positive

•– Better to hold inventory than incur a backlog

allfor 0 ihi >

11

)( Hph isMN

ii +<⋅ −

=∑ α

Page 14: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Long-run Inventory position

Lemma 1: (See page 568 of Rosling paper)

Lemma 2: (See page 568 of Rosling paper)

Page 15: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Long-run Inventory positionTheorem 1: “Any policy satisfying Lemmas 1 and 2 leads

the system into long-run balance and keeps it there. This will take not more than MN+1 periods after accumulated demand exceeds Maxi Xi1.”

Proof: Outline–

– long-run balance for i for – Upper bound q(i)

1 Lemmaby )( allfor ,1 iqtXX Ltiit ≥≤ +

µ

ξξ µµ

−+=

=−≤−= −+

=

=+

− ∑∑i

Mti

t

qrr

t

qr

Lqiriq

Mit

Miqt

XXYX

)(for

,1

11

,1

iMiqt +≥ )(

Page 16: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Equivalent Series SystemTheorem 2: If the Assumptions hold and system is initially

in long-run balance, then optimal policies of the assembly system are equivalent to those of a pure series system where:– i succeeds item i+1– lead-time of item i is Li

– holding costProof: Cost function

ii Llii hh −⋅← α

Constant

)()()()(E Min 111

11i

1

Y1

+⎪⎭

⎪⎬⎫

⎪⎩

⎪⎨⎧

⎟⎟⎠

⎞⎜⎜⎝

⎛−+⋅+⋅⋅ ∫∑∑

∞+

=

−∞

=

− ξξφξαααα dYHpYhit

iii

Y

Lit

LN

iit

Lli

Lt

Page 17: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Equivalent Series SystemEasy to show, using Theorem 1,:

Hence, using Lemma 1,

Use this constraint in Problem P.

)( and , allfor iPktiXX iMMktit ∈≤ −

Ltiitit XYX ,1

*+≤≤

Page 18: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

New Formulation for P

Constant

)()()()(E Min 111

11i

1

Y1

+⎪⎭

⎪⎬⎫

⎪⎩

⎪⎨⎧

⎟⎟⎠

⎞⎜⎜⎝

⎛−+⋅+⋅⋅ ∫∑∑

∞+

=

−∞

=

− ξξφξαααα dYHpYhit

iii

Y

Lit

LN

iit

Lli

Lt

tiXYX Ltiitit , allfor

such that

,1+≤≤

11,

1

,11

and

where

−−

−=−++

−=

−= ∑

ttiit

t

LtssLti

L,ti

YX

YX

ξ

ξ

Page 19: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Equivalent Series SystemCorollary 2: There exist Si’s such that the following policy is

optimal for all i and t

Si – obtained from Clark and Scarf’s (1960) procedure

• Critically dependent on initial inventory level assumption (long-run balance initial inventory levels)

• Generally optimal policy by Schmidt and Nahmias (1985)

iititit

iitL

tiiit

SXXYSXXSY

≥=≤= +

if if ),Min(

*,1

*

Page 20: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Equivalent Series System

Corollary 3: If Li=0, then– Optimal order policy with Si = Si-1

– i and i-1 can be aggregated– lead time of aggregate Li-1

– holding cost coefficient 11

−−− + iL

ii hh α

Page 21: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

General Assumption on Costs• Generalized Assumption

• Allowed to have for some i• Examples: Meat or Rubber after cooking/ vulcanization

– Components more expensive to store than assemblies

– May have negative echelon holding costs

0≤ih

(See page 571, section 4)

Page 22: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Generalized Assumption

• Aggregation procedure to eliminate i for which

• Leads to an assembly system satisfying the original assumption

0≤ih

Page 23: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Practical Necessity of Generalized Assumption

1. If

– Minimal cost of P is unbounded

2. If – item i is a free good, hence predecessors of

i may be neglected

3. If assumption (ii) not satisfied – production eventually ceases

ihh ksis M

iBk kM

i somefor 0)()(

)(<⋅+⋅ −

− ∑ αα

ihh ksis M

iBk kM

i somefor 0)()(

)(=⋅+⋅ −

− ∑ αα

Page 24: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Summary• Assembly system:

- Ordered amounts available after a fixed lead time- Random customer demands only for the end product- Assumptions on cost parameters

• Under assumptions and restriction on initial stock levels, assembly system can be treated as a series system

• Simple optimal inventory policy – can be calculated by approach in Clark and Scarf’s paper (1960)*

*Clark, A.J. and Herbert Scarf. “Optimal Policies for a Multi-echelon InventoryProblem.” Management Science 6 (1960): 475-90.

Page 25: Optimal Inventory Policies For Assembly Systems Under Random Demands   Assemble To Order System   Shobhit Gupta

Comments

• Series analogy does not work for:– Non stationary holding/production costs– Non-zero setup costs