A Production Network Model and Its Diffusion Approximation.

Abstract

This report develops and analyzes a general stochastic model of a production system. The model is closely related to Harrison's (5) assembly-like queueing network, the principal difference being that here we assume all storage buffers have finite capacity. Our attention is focused on a vector stochastic process Z whose components are the contents of the various storage buffers (as functions of time). The principal result is a weak convergence theorem of the type developed by Iglehart and Whitt (7) for queues in heavy traffic. This limit theorem shows that, with large buffers and balanced loading of the system's work stations, a properly normalized version of the storage process Z can be well approximated by a certain vector diffusion process Z*. We construct Z* by applying a particular (and rather complicated) reflection mapping to multidimensional Brownian motion. Various properties of the limiting diffusion Z* are developed, but these provide only a modes beginning for the analytical theory that must be developed before our limit theorem can lead to practically useful approximation procedures.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1982
Accession Number
ADA120685

Entities

People

  • Michael Louis Wenocur

Organizations

  • Stanford University

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Assembly
  • Brownian Motion
  • Convergence
  • Ergodic Processes
  • Manufacturing
  • Markov Chains
  • Markov Processes
  • Operations Research
  • Probability
  • Production
  • Random Variables
  • Random Walk
  • Reflection
  • Stations
  • Stochastic Processes
  • Weak Convergence
  • Work Stations

Fields of Study

  • Mathematics

Readers

  • Calculus or Mathematical Analysis
  • Computer Networking
  • Statistical inference.