Volume 15, Numbers 1-4, March 1994
- Masakiyo Miyazawa:
Rate conservation laws: A survey.
1-58
- Peter Buchholz:
A class of hierarchical queueing networks and their analysis.
59-80
- Vidyadhar G. Kulkarni, Lindsey C. Puryear:
A reader-writer queue with reader preference.
81-97
- Rajendran Rajan, Rajeev Agrawal:
Cyclic networks with general blocking and starvation.
99-136
- Nicholas Bambos, Kimberly M. Wasserman:
On stationary tandem queueing networks with job feedback.
137-164
- Douglas J. Morrice, Ravindra S. Gajulapalli, Sridhar R. Tayur:
A single server queue with cyclically indexed arrival and service rates.
165-198
- Yves Dallery:
On modeling failure and repair times in stochastic models of manufacturing systems using generalized exponential distributions.
199-209
- Christine Fricker, M. Raouf Jaïbi:
Monotonicity and stability of periodic polling models.
211-238
- Cheng-Shang Chang, Joy A. Thomas, Shaw-Hwa Kiang:
On the stability of open networks: A unified approach by stochastic dominance.
239-260
- Süleyman Özekici, Jingwen Li, Fee Seng Chou:
Queues with impolite customers.
261-277
- Fabrice Guillemin, Ravi R. Mazumdar:
On pathwise behavior of multiserver queues.
279-288
- António Pacheco:
Second-order properties of the loss probability inM/M/s/s +c systems.
289-308
- António Pacheco:
Some properties of the delay probability inM/M/s/s +c systems.
309-324
- Israel Cidon, Asad Khamisy, Moshe Sidi:
On queueing delays of dispersed messages.
325-345
- Yiqiang Zhao:
Analysis of the GIX/M/c model.
347-364
- Jen Yeng Cheah, James MacGregor Smith:
Generalized M/G/C/C state dependent queueing models and pedestrian traffic flows.
365-386
- Ho Woo Lee, Soon Seok Lee, Kyung C. Chae:
Operating characteristics of MX/G/1 queue with N-policy.
387-399
- C. Armero, M. J. Bayarri:
Bayesian prediction inM/M/1 queues.
401-417
- Carmen Armero:
Bayesian inference in Markovian queues.
419-426
Last update Sun May 26 18:40:54 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
