An upper bound for carriers in a three-workstation closed serial production system operating under production blocking

IEEE Transactions on Automatic Control

Volumn 47, Issue 7, 2002, Pages 1134-1138

  Kim, David S ^a   Kulkarni, Devadatta M ^b   Lin, Feng ^c  

^a OREGON STATE UNIVERSITY   (United States)

^b OAKLAND UNIVERSITY   (United States)

^c Wayne State University   (United States)

Author keywords

Closed queueing networks; Discrete event systems; Manufacturing systems; Performance comparison; Queueing systems

Indexed keywords

AUTOMATA THEORY; BOUNDARY CONDITIONS; BUFFER STORAGE; CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL LINGUISTICS; COMPUTER SIMULATION; COMPUTER WORKSTATIONS; PERT; PRODUCTION CONTROL; QUEUEING NETWORKS; REMOTELY OPERATED VEHICLES; THEOREM PROVING;

CLOSED QUEUEING NETWORKS; CLOSED SERIAL PRODUCTION SYSTEM; DISCERETE EVENT SYSTEMS; MANUFACTURING SYSTEMS; PRODUCTION BLOCKING; UPPER BOUND;

DISCRETE TIME CONTROL SYSTEMS;

EID: 0036646891     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/TAC.2002.800653     Document Type: Article

References (11)

1. Symmetry property of the throughput in closed tandem queueing networks with finite buffers
2. Equivalence, reversibility, symmetry, and concavity properties in fork/join queueing networks with blocking
3. Properties of fork/join queueing networks with blocking under various operating mechanisms
4. Structured buffer-allocation problems
5. An upper bound for carriers in a three-workstation closed serial production system operating under production blocking
6. A linguistic approach to stochastic comparison of queueing systems
7. Analysis of temporal performance of supervised discrete event systems
8. Generalized semi-Markov processes: A view through supervisory control
9. A decomposition method for throughput analysis of cyclic queues with production blocking
10. Monotonicity properties in cyclic queueing networks with finite buffers