Service time (source code)

= Service time
{title2=$S$}

A <service time> $S$ is the time needed to complete a customer's <service requirement> when a server works on that customer at the declared full capacity. If the required work is $B$ and capacity is $c$, then $S=B/c$. Its <expected value> is a duration. In an <M M 1 queue>, the parameter $\mu$ of the <exponential distribution> has units of inverse time, and $\mathbb ES=1/\mu$.

Under uninterrupted <first come first served>, the customer's time in service equals $S$, while its <customer sojourn time> also includes the preceding <queueing delay>. Under <processor sharing>, elapsed time can be longer than $S$ because each customer receives only a fraction of the capacity. For example, two jobs arriving together, each requiring six work units, finish after four seconds on a three-unit-per-second sharing server; each has full-capacity <service time> two seconds.

A <residual service time> is the remaining full-capacity service duration. Service-time variability affects the <Pollaczek-Khinchine mean formula>, whereas <Little's law> needs the relevant finite means and consistent system boundaries rather than an exponential service distribution.