Service Time and Service Mechanisms

• Service time of a successive arrivals are denoted by $S_1, S_2, S_3, ...$. They may be constants or random variables. If they are random variables, they follow certain distribution.
• A queueing system consists of service centers and inter-connecting queues.
• Each service cetner contains a number of servers, c.
  • $c = 1$ single server
  • $1 < c < \infty$ multiple servers
  • $c = \infty$ unlimited servers

• Transition state and steady state: simulation needs some time to ``warm up'' from a initial state to a steady state. The status in a transition state should not be considered as indicative as typical measures. One should always wait until certain time elapses before collecting statistics.

• Examples 7.1 and 7.2 on page 239