Availability and Average Inventory of Balanced Assembly-Like Flow Systems

JOHN T. SIMON · Wallace J. Hopp

24 citations0/0 files storedIIE Transactions

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Reliability and Maintenance Optimization Petri Nets in System Modeling

Abstract

An assembly-like system is one that requires resources simultaneously from more than one input source and produces a single output. Here we consider a balanced assembly-like flow system, where an assembly machine is fed from storage buffers of two input machines that are subject to random failures, and compute its average throughput and average inventories. We also show how to optimize the buffer sizes in this system

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

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

Citations in this library

Citation map →

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

References

1973Assembly-like queues 1991Assembly/Disassembly Systems: An Efficient Decomposition Algorithm for Tree-Structured Networks 1986Assembly-like queues with finite capacity: Bounds, asymptotics and approximations 1981Queues with paired customers 1986Finite capacity assembly-like queues 1985Simple computable bounds for the fork-join queue 1987An approximate analysis for a class of assembly-like queues

Cited by

2008Coordination and synchronization of material flows in supply chains: An analytical approach 1993Estimating throughput in an unbalanced assembly-like flow system 2003Performance analysis of assembly systems with unreliable machines and finite buffers

Explore the map →

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

Imported from OpenAlex (CC0) — nothing here is generated.