Module 7:Application of stochastic processes in queueing theory
  Lecture 29:Application of stochastic processes in Queueing Theory
 


What we can glean from the set of information given above


Thus for the general nth customer in the queue we have defined the following, which are: (i) his/her inter arrival time, (ii) his/her service time, (iii) his/her waiting time, (iv) his/her system time.
Thus the main data which we will have in front of us would be the sequence of , ,  and

What is of interest to us

  •   and , where l is the average arrival time

  • We denote, again for our convenience the following

Metric # 1 (average waiting time or cumulative waiting time, considering there is only one (1) machine only)

Minimize the average waiting time (cumulative waiting time), i.e., minimize:  , which is .