Stochastic Fluid Models in Inventory Control Problems

Similar documents
Markov processes and queueing networks

IEOR 6711, HMWK 5, Professor Sigman

8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains

JRF (Quality, Reliability and Operations Research): 2013 INDIAN STATISTICAL INSTITUTE INSTRUCTIONS

The Transition Probability Function P ij (t)

Single-part-type, multiple stage systems

Part I Stochastic variables and Markov chains

MARKOV PROCESSES. Valerio Di Valerio

Markov chains and the number of occurrences of a word in a sequence ( , 11.1,2,4,6)

(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

CDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical

Data analysis and stochastic modeling

Lecture 21. David Aldous. 16 October David Aldous Lecture 21

IEOR 4106: Introduction to Operations Research: Stochastic Models Spring 2011, Professor Whitt Class Lecture Notes: Tuesday, March 1.

Markov Chains and MCMC

This lecture is expanded from:

Markov Chains (Part 4)

Markov Processes Cont d. Kolmogorov Differential Equations

Analysis of fluid queues in saturation with additive decomposition

Mathematical foundations - linear algebra

CS145: Probability & Computing Lecture 18: Discrete Markov Chains, Equilibrium Distributions

Stochastic process. X, a series of random variables indexed by t

STOCHASTIC MODELS FOR RELIABILITY, AVAILABILITY, AND MAINTAINABILITY

Controlling conventional generation to minimize forecast error cost

Dynamic interpretation of eigenvectors

Markov chains. 1 Discrete time Markov chains. c A. J. Ganesh, University of Bristol, 2015

MARKOV MODEL WITH COSTS In Markov models we are often interested in cost calculations.

2001, Dennis Bricker Dept of Industrial Engineering The University of Iowa. DP: Producing 2 items page 1

Basics of Stochastic Modeling: Part II

Statistics 150: Spring 2007

MATH 56A: STOCHASTIC PROCESSES CHAPTER 1

CDA6530: Performance Models of Computers and Networks. Chapter 3: Review of Practical Stochastic Processes

Continuous Time Markov Chain Examples

Outlines. Discrete Time Markov Chain (DTMC) Continuous Time Markov Chain (CTMC)

6-1 Study Guide and Intervention Multivariable Linear Systems and Row Operations

Statistics 992 Continuous-time Markov Chains Spring 2004

x x 1 0 1/(N 1) (N 2)/(N 1)

MATH 564/STAT 555 Applied Stochastic Processes Homework 2, September 18, 2015 Due September 30, 2015

Math Camp Notes: Linear Algebra II

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

On the Convexity of Discrete (r, Q) and (s, T ) Inventory Systems

Markov Chains, Stochastic Processes, and Matrix Decompositions

Positive Harris Recurrence and Diffusion Scale Analysis of a Push Pull Queueing Network. Haifa Statistics Seminar May 5, 2008

Gideon Weiss University of Haifa. Joint work with students: Anat Kopzon Yoni Nazarathy. Stanford University, MSE, February, 2009

Solutions to Homework Discrete Stochastic Processes MIT, Spring 2011

Inventory Control with Convex Costs

Statistical signal processing

Expected Time Delay in Multi-Item Inventory Systems with Correlated Demands

Probability Models. 4. What is the definition of the expectation of a discrete random variable?

Queueing systems in a random environment with applications

Solving Linear Rational Expectations Models

A general algorithm to compute the steady-state solution of product-form cooperating Markov chains

7.1 INTRODUCTION. In this era of extreme competition, each subsystem in different

LTCC. Exercises solutions

18.175: Lecture 30 Markov chains

Introduction to Queuing Networks Solutions to Problem Sheet 3

Irreducibility. Irreducible. every state can be reached from every other state For any i,j, exist an m 0, such that. Absorbing state: p jj =1

18.440: Lecture 33 Markov Chains

Lecture 5: Random Walks and Markov Chain

A Single-Unit Decomposition Approach to Multiechelon Inventory Systems

µ n 1 (v )z n P (v, )

Stochastic Processes

Asymptotically Optimal Inventory Control For Assemble-to-Order Systems

MIT Manufacturing Systems Analysis Lectures 19 21

Lecture 6: Discrete-Time Dynamic Optimization

National Sun Yat-Sen University CSE Course: Information Theory. Maximum Entropy and Spectral Estimation

ELEMENTS OF PROBABILITY THEORY

ALMOST SURE CONVERGENCE OF RANDOM GOSSIP ALGORITHMS

Multi Stage Queuing Model in Level Dependent Quasi Birth Death Process

Lecture 4a: Continuous-Time Markov Chain Models

1 Similarity transform 2. 2 Controllability The PBH test for controllability Observability The PBH test for observability...

Closed-Form Approximations for Optimal (r, q) and (S, T ) Policies in a Parallel Processing Environment

LECTURE NOTES: Discrete time Markov Chains (2/24/03; SG)

MATH37012 Week 10. Dr Jonathan Bagley. Semester

Chapter 3, 4 Random Variables ENCS Probability and Stochastic Processes. Concordia University

Department of Applied Mathematics Faculty of EEMCS. University of Twente. Memorandum No Birth-death processes with killing

6 Continuous-Time Birth and Death Chains

The Jordan Normal Form and its Applications

Birth and Death Processes. Birth and Death Processes. Linear Growth with Immigration. Limiting Behaviour for Birth and Death Processes

Continuous Time Processes

0.1 Naive formulation of PageRank

On Stopping Times and Impulse Control with Constraint

ECE353: Probability and Random Processes. Lecture 5 - Cumulative Distribution Function and Expectation

Link Analysis. Leonid E. Zhukov

6.231 DYNAMIC PROGRAMMING LECTURE 13 LECTURE OUTLINE

18.600: Lecture 32 Markov Chains

Chapter 2 Analysis of Pull Postponement by EOQ-based Models

PROBABILITY: LIMIT THEOREMS II, SPRING HOMEWORK PROBLEMS

STOCHASTIC PROCESSES Basic notions

Lecture 11: Introduction to Markov Chains. Copyright G. Caire (Sample Lectures) 321

THIELE CENTRE. The M/M/1 queue with inventory, lost sale and general lead times. Mohammad Saffari, Søren Asmussen and Rasoul Haji

Tales of Time Scales. Ward Whitt AT&T Labs Research Florham Park, NJ

A Customer-Item Decomposition Approach to Stochastic Inventory Systems with Correlation

Chapter 4: Interpolation and Approximation. October 28, 2005

Extreme Values and Positive/ Negative Definite Matrix Conditions

Exact Simulation of the Stationary Distribution of M/G/c Queues

More chapter 3...linear dependence and independence... vectors

Chapter 1. Introduction. 1.1 Stochastic process

2 Random Variable Generation

Transcription:

Stochastic Fluid Models in Problems (Joint work with Keqi Yan ) Department of Statistics and Operations Research March, 2006

Outline 1 2 Stability condition Differential equations Solution to the differential equations 3 4

The Model A background process {Z(t), t 0}. Almost an irreducible CTMC, finite state space S, generator Q. A fluid level process {X(t), t 0}. When Z(t) = i, X(t) changes at rate R i. When the fluid level hits zero in state i, it instantaneously jumps to q, and the background process jumps to j with probability α ij.

Outline Stability condition Differential equations Solution 1 2 Stability condition Differential equations Solution to the differential equations 3 4

Stability Condition Stability condition Differential equations Solution The bivariate Markov process {(X(t), Z(t))} has a limiting distribution G j (x) := lim t P{X(t)>x, Z(t) = j}, x 0, t 0, i S, if the expected net production rate π i R i < 0, i S where π i satisfies { πq = 0 πe = 1.

Outline Stability condition Differential equations Solution 1 2 Stability condition Differential equations Solution to the differential equations 3 4

Notation Stability condition Differential equations Solution The row vector G(x) := [G 1 (x),..., G n (x)]. Its derivative [ G dg1 (x) (x) :=,..., dg ] n(x). dx dx Diagonal matrix R := R 1 R 2... Rn.

Differential Equations Stability condition Differential equations Solution Theorem: Limiting Distribution The limiting distribution G(x) satisfies G (x)r = G(x)Q + β, if x < q, G (x)r = G(x)Q, if x > q, where the row vector β := G (0)RA. The boundary conditions are given by lim G(x) = 0, x G j (q + ) = G j (q ), j : R j 0, G j(0) = 0, j : R j > 0, G(0) e = 1.

Proof. Stability condition Differential equations Solution Differential Equations G (x)r = G(x)Q, if x > q. G (x)r = G(x)Q + β, if x < q. x > q, standard fluid model, x < q, β j = i:r i <0 R i G i (0)α ij the rate of transitions into state j due to the jump of the inventory level from 0 to q.

Stability condition Differential equations Solution Proof. (continued) Boundary Conditions 1 lim G(x) = 0. x G(x) complementary probability at x. 2 G j (q + ) = G j (q ), j : R j 0 Continuity at q. 3 G j (0) = 0, j : R j > 0 1 G : the expected time between two j (0)Rj consecutive visits to the state (0, j). 4 G(0)e = 1 G j (0) = lim P{X(t) [0, ), Z(t) = j}. t

Stability condition Differential equations Solution Proof. (continued) Boundary Conditions 1 lim G(x) = 0. x G(x) complementary probability at x. 2 G j (q + ) = G j (q ), j : R j 0 Continuity at q. 3 G j (0) = 0, j : R j > 0 1 G : the expected time between two j (0)Rj consecutive visits to the state (0, j). 4 G(0)e = 1 G j (0) = lim P{X(t) [0, ), Z(t) = j}. t

Stability condition Differential equations Solution Proof. (continued) Boundary Conditions 1 lim G(x) = 0. x G(x) complementary probability at x. 2 G j (q + ) = G j (q ), j : R j 0 Continuity at q. 3 G j (0) = 0, j : R j > 0 1 G : the expected time between two j (0)Rj consecutive visits to the state (0, j). 4 G(0)e = 1 G j (0) = lim P{X(t) [0, ), Z(t) = j}. t

Stability condition Differential equations Solution Proof. (continued) Boundary Conditions 1 lim G(x) = 0. x G(x) complementary probability at x. 2 G j (q + ) = G j (q ), j : R j 0 Continuity at q. 3 G j (0) = 0, j : R j > 0 1 G : the expected time between two j (0)Rj consecutive visits to the state (0, j). 4 G(0)e = 1 G j (0) = lim P{X(t) [0, ), Z(t) = j}. t

Outline Stability condition Differential equations Solution 1 2 Stability condition Differential equations Solution to the differential equations 3 4

Notation Stability condition Differential equations Solution Let (λ i, φ i ) be an (eigenvalue, eigenvector) pair that solves φ i (λ i R Q) = 0. Fact: There is exactly one eigenvalue 0, and its corresponding eigenvector is π. 0 Λ := λ 2... λ n, Φ := π φ 2... φ n.

Stability condition Differential equations Solution Solution to the Differential Equations Theorem: Solving the differential equations by solving a linear system The solution to the differential equations is given by { ce G(x) = Λx Φ + sxπ + d x < q, ae Λx Φ x > q, where a, c, d and s are the unique solution to the following system of equations: cλφr + sπr + dq = 0, (ae Λq Φ ce Λq Φ sqπ d)i R 0 = 0, a i = 0, i : λ i 0, m c i λ i φ ij + sπ j = 0, j : R j > 0, i=0 (cφ + d)e = 1, d e = 1.

Stability condition Differential equations Solution Proof. 1 cλφr + sπr + dq = 0 sxπ + d is a particular solution to G (x)r = G(x)Q + β. 2 (ae Λq Φ ce Λq Φ sqπ d)i R 0 = 0 G j (q + ) = G j (q ), j : R j 0. 3 a i = 0, i : λ i 0 lim G(x) = 0. x m 4 c i λ i φ ij + sπ j = 0, j : R j > 0 i=0 G j(0) = 0, j : R j > 0. 5 (cφ + d)e = 1 G(0)e = 1. 6 d e = 1. Uniquely determine all the coefficients.

Stability condition Differential equations Solution Proof. 1 cλφr + sπr + dq = 0 sxπ + d is a particular solution to G (x)r = G(x)Q + β. 2 (ae Λq Φ ce Λq Φ sqπ d)i R 0 = 0 G j (q + ) = G j (q ), j : R j 0. 3 a i = 0, i : λ i 0 lim G(x) = 0. x m 4 c i λ i φ ij + sπ j = 0, j : R j > 0 i=0 G j(0) = 0, j : R j > 0. 5 (cφ + d)e = 1 G(0)e = 1. 6 d e = 1. Uniquely determine all the coefficients.

Stability condition Differential equations Solution Proof. 1 cλφr + sπr + dq = 0 sxπ + d is a particular solution to G (x)r = G(x)Q + β. 2 (ae Λq Φ ce Λq Φ sqπ d)i R 0 = 0 G j (q + ) = G j (q ), j : R j 0. 3 a i = 0, i : λ i 0 lim G(x) = 0. x m 4 c i λ i φ ij + sπ j = 0, j : R j > 0 i=0 G j(0) = 0, j : R j > 0. 5 (cφ + d)e = 1 G(0)e = 1. 6 d e = 1. Uniquely determine all the coefficients.

Stability condition Differential equations Solution Proof. 1 cλφr + sπr + dq = 0 sxπ + d is a particular solution to G (x)r = G(x)Q + β. 2 (ae Λq Φ ce Λq Φ sqπ d)i R 0 = 0 G j (q + ) = G j (q ), j : R j 0. 3 a i = 0, i : λ i 0 lim G(x) = 0. x m 4 c i λ i φ ij + sπ j = 0, j : R j > 0 i=0 G j(0) = 0, j : R j > 0. 5 (cφ + d)e = 1 G(0)e = 1. 6 d e = 1. Uniquely determine all the coefficients.

Stability condition Differential equations Solution Proof. 1 cλφr + sπr + dq = 0 sxπ + d is a particular solution to G (x)r = G(x)Q + β. 2 (ae Λq Φ ce Λq Φ sqπ d)i R 0 = 0 G j (q + ) = G j (q ), j : R j 0. 3 a i = 0, i : λ i 0 lim G(x) = 0. x m 4 c i λ i φ ij + sπ j = 0, j : R j > 0 i=0 G j(0) = 0, j : R j > 0. 5 (cφ + d)e = 1 G(0)e = 1. 6 d e = 1. Uniquely determine all the coefficients.

Stability condition Differential equations Solution Proof. 1 cλφr + sπr + dq = 0 sxπ + d is a particular solution to G (x)r = G(x)Q + β. 2 (ae Λq Φ ce Λq Φ sqπ d)i R 0 = 0 G j (q + ) = G j (q ), j : R j 0. 3 a i = 0, i : λ i 0 lim G(x) = 0. x m 4 c i λ i φ ij + sπ j = 0, j : R j > 0 i=0 G j(0) = 0, j : R j > 0. 5 (cφ + d)e = 1 G(0)e = 1. 6 d e = 1. Uniquely determine all the coefficients.

A Special Case: R < 0 and A = I Stability condition Differential equations Solution Uniform distribution in steady state When the net input rate is non-positive, i.e., R i < 0, i, and A = I, G(x) = (1 x/q)π, x [0, q]. Remark: In steady state, (1) X U[0, q]; (2) X is independent of Z.

Outline 1 2 Stability condition Differential equations Solution to the differential equations 3 4

An Inventory Model X(t) = inventory level at time t. Z(t) = state of the environment at time t, a CTMC with generator matrix Q. R i = rate at which inventory changes when Z(t) = i. The assumptions: No back order. Zero leadtimes. Order when inventory reaches zero. Order sizes independent of the environment state. {(X(t), Z(t)), t 0}: A special case of the fluid model with jumps where A = I.

Cost Model The costs: h: holding cost of one unit of product per unit of time; k: fixed set-up cost to place an order; p 1 : per unit purchasing cost; p 2 : per unit production cost. The goal: to compute the optimal q that minimizes the long-run total cost per unit of time.

Cost Rates Calculation Total cost rate c(q) as a function of q c(q) = c h (q) + c o (q) + c p (q), where c h (q), c o (q) and c p (q) are the steady-state holding, ordering, and production cost rates. Theorem: Costs as functions of q [ c h (q) = h (c a) Λe Λq Φ + s ] 2 πq2 + (d + c 1 π)q c ΛΦ e c o (q) = (k + p 1 q)(cλφ + sπ)re c p (q) = p 2 (cφ + d) Re Notation Λ = (0, 1 λ 2,..., 1 λ n ) r i = production rate at state i d i = demand rate at state i R = diag(r 1, r 2,...r n) R = diag(r 1, R 2,...R n) R i = r i d i

Proof. 1 c h [(q) = ] h (c a) Λe Λq Φ + s 2 πq2 + (d + c 1 π)q c ΛΦ e c h (q) = h j S x=0 G j(x)dx. 2 c o (q) = (k + p 1 q)(cλφ + sπ)re c o (q) = (k + p 1 q) j S G j(0)r j. 3 c p (q) = p 2 (cφ + d) Re c p (q) = p 2 G j (0)r j. j S

Proof. 1 c h [(q) = ] h (c a) Λe Λq Φ + s 2 πq2 + (d + c 1 π)q c ΛΦ e c h (q) = h j S x=0 G j(x)dx. 2 c o (q) = (k + p 1 q)(cλφ + sπ)re c o (q) = (k + p 1 q) j S G j(0)r j. 3 c p (q) = p 2 (cφ + d) Re c p (q) = p 2 G j (0)r j. j S

Proof. 1 c h [(q) = ] h (c a) Λe Λq Φ + s 2 πq2 + (d + c 1 π)q c ΛΦ e c h (q) = h j S x=0 G j(x)dx. 2 c o (q) = (k + p 1 q)(cλφ + sπ)re c o (q) = (k + p 1 q) j S G j(0)r j. 3 c p (q) = p 2 (cφ + d) Re c p (q) = p 2 G j (0)r j. j S

Optimality of EOQ with Stochastic Production and Demand Theorem: Stochastic EOQ formula Suppose > 0. The optimal order size q that minimizes the total cost rate c(q) is given by: q = 2k /h, where is the expected net demand rate = i π i R i.

Proof. 1 Decompose {X(t)} into {X 1 (t)} and {X 2 (t)}. 2 In steady state {X 1 (t)} has uniform distribution. Decompose {X 1 (t)} into {Y 0 (t)} and {Y 1 (t)}. Y 0 U[0, q] (The special case). Y 1 U[0, q] (Construct a semi-markov process). 3 {X 2 (t)} is independent of q. 4 c(q) = hq 2 + k q + C. 5 q 2k = h.

Decompose {X(t)} into {X 1 (t)} and {X 2 (t)}

Correspondence of {X 1 (t)} and {Y 0 (t)}

Correspondence of {X 1 (t)} and {Y 1 (t)}

A Numerical Example n identical independent machines. Lifetime exp(µ), repair time exp(λ). Z(t) = number of working machines at time t. Background process {Z(t), t 0} : CTMC.

Inventory Level Process {X(t), t 0} When there are i working machines, Production rate i r. Demand rate d (constant). R i = i r d, positive, or negative. When inventory level hits 0, an order of size q is placed and arrives instantaneously.

Limiting Distribution Complementary Cumulative Distribution Function n = 3, d = 3, r i = 2.5 i, λ = 1, µ = 2, q = 3.

Limiting Distribution Probability Density Function n = 3, d = 3, r i = 2.5 i, λ = 1, µ = 2, q = 3.

d = n, r i = i r, λ = 1, µ = 2, h = 10, k = 2, p 1 = 8 and p 2 = 5. Let r vary in (0, 3). q decreases with r. q reaches zero when r increases to 3. For a fixed r, q increases with n, but sublinearly.

An Extension: Backlogging Allowed Basic model: place an order as soon as inventory reaches 0. Extended model: Don t place an order until backorders accumulate to r. b: backlogging cost of one unit of product per unit of time;.

Stochastic EOQ with Backlogging Theorem: Stochastic EOQ with backlogging Suppose A = I, > 0. Then 2k(b + h) q = ( hb ) h r = q. b + h Remark: This is equivalent to the deterministic EOQ formula with backlogging. Proof. sample path is the same as in basic model except for a shift in the y-axis.

Outline 1 2 Stability condition Differential equations Solution to the differential equations 3 4

Ordering Policy Basic model: one common order size q. Extended model: place an order of size q i if the environment state is i at the time of ordering.

Method 1: Piecewise Function G(x)Q, when x > G qm (x)r = G(x)Q + β (i), when q i 1 < x < q i, i S β (i) = G (0)RI (i) i 1 i 0 1 0.... I (i) i 1 = 0 i 1 B.. @.. n 1 1 C A.

Method 2: Sample Path Decomposition the Inventory Level Process and the Cycle Type Process

Sample Path Decomposition Method I(t): cycle type at time t. {(X(t), Z(t)), t 0} restrict to I(t) = i is a special case of the basic fluid model with 0 1 0... 1... 0 2 0... 1... 0 A =. B@............... n 0... 1... 0 p (i) = lim t P{I(t) = i} steady-state probability that the system is in the i-th type cycle (SMP). i 1 CA. G(x) = i:r i <0 G (i) (x)p (i)

Advantages of Method 2 1 Complexity in matrix calculation. Method 1: we need to solve m groups of equations simultaneously. Method 2: solve m groups of equations separately. 2 Varying ranges of q i s. Method 1: q i varies in [q i 1, q i+1 ]. Method 2: no need to specify ranges.

A Machine Shop Example n = 2, d = 2, r i = i r, λ = 1, µ = 2, h = 5, k = 0.5, p 1 = 5 and p 2 = 8. Let r vary in (0, 3).

Outline 1 2 Stability condition Differential equations Solution to the differential equations 3 4

Stochastic Leadtimes Basic model: external orders arrive instantaneously. Extended model: leadtimes are iid exp(µ) random variables. X(t): inventory level at time t; Z(t): external environment state at time t; O(t): number of outstanding orders at time t; W(t) = (Z(t), O(t)). P(t): inventory position at time t, P(t) = X(t) + q O(t). Policy: External orders of size q are placed when the inventory position reaches r. Observation: {(P(t), W(t)), t 0} is a fluid model with jumps.

Sample Path of the Inventory Position Process and the Inventory Level Process

One External Supplier with Limited Number of Outstanding Orders Let G (i) (x) = lim t P{X(t) > x, O(t) = i} Then G(x) = G (i) (x i q), i {0, 1,..., N} G (0) (x)r = G (0) (x)q + µg (1) (x) G (i) (x)r = G (i) (x)q + µg (i+1) (x) + G (i 1) (0)R i = 1, 2,..., N 1 G (N) (x)r = G (N) (x)q + µg (N) (x) + G (N 1) (0)R

One External Supplier with Limited Number of Outstanding Orders Ḡ(x) := [G (0) (x), G (1) (x),..., G (N) (x)] Q := Ā := 0 B @ 0 B @ Q µi Q µi...... 0 I 0 I...... µi Q µi 0 I I 1 C A 1 C A

Infinite External Suppliers G (0) (x)r = G (0) (x)q + µg (1) (x) G (i) (x)r = G (i) (x)q + (i + 1)µG (i+1) (x) + G (i 1) (0)R i = 1, 2,... Q := 0 B @ Q... µi Q µi... 2µI Q 2µI... 3µI Q 3µI...... 1 C A Ā := 0 B @ 0 I... 0 I... 0 I...... 1 C A

Future Research State-Dependent Cost Rates Basic model: state-independent linear cost rates. Extended model: cost rates depend on the environmental process. SMP Background Process Basic model: CTMC background process. Extended model: SMP background process.

Thank you! Questions? Chairman, Department of Statistics and Operations Research, CB 3260 University of North Carolina, Chapel Hill, NC, USA, 27599 Phone: 919-962-3837 Fax: 919-962-0391 vkulkarn@email.unc.edu http://www.unc.edu/ vkulkarn/