1. A finite‐capacity queue with exhaustive vacation/close‐down/setup times and Markovian arrival processes

   • Zhisheng Niu
   • Yoshitaka Takahashi

   OriginalPaper Pages: 1 - 23

2. Numerical approximations for the steady‐state waiting times in a GI/G/1 queue

   • B. Venkateshwara Rao
   • Richard M. Feldman

   OriginalPaper Pages: 25 - 42

3. Infinitesimal perturbation analysis for queueing networks with general service time distributions

   • Bernd Heidergott

   OriginalPaper Pages: 43 - 58

4. A sample path analysis of the M _t /M _t /c queue

   • Barbara Haas Margolius

   OriginalPaper Pages: 59 - 93

5. Modelling and analysis of M/G ^a,b /1/N queue – A simple alternative approach

   • M.L. Chaudhry
   • U.C. Gupta

   OriginalPaper Pages: 95 - 100

6. Start‐up class models in multiple‐class queues with N‐policy

   • H.W. Lee
   • S.H. Yoon
   • W.J. Seo

   OriginalPaper Pages: 101 - 124

7. Simple bounds for closed queueing networks

   • Arie Harel
   • Su Namn
   • Jacob Sturm

   OriginalPaper Pages: 125 - 135

8. Optimal trajectory to overflow in a queue fed by a large number of sources

   • Michel Mandjes
   • Ad Ridder

   OriginalPaper Pages: 137 - 170