ISSN:
1572-9443
Keywords:
Assembly-like queues
;
bounds
;
approximations
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract We consider an assembly system with exponential service times, and derive bounds for its average throughput and inventories. We also present an easily computed approximation for the throughput, and compare it to an existing approximation.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01158549
Permalink