Analysis of Transfer Lines Consisting of Two Unreliable Machines with Random Processing Times and Finite Storage Buffers

Abstract

A Markov process model of a transfer line is presented in which there are two machines and a single finite buffer. The machines have exponential service, failure, and repair processes. The movement of discrete parts is represented. The model is analyzed and a compact solution is obtained. Limiting behavior is investigated and numerical results are discussed.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 188 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.