Dispatching to two parallel nonobservable queues using only static information) is unavailable for the dispatcher. For such nonobservable queues, it is known that minimum mean
sojourn time Using inter-arrival times for scheduling in non-observable queues respect to the job's mean waiting and mean
sojourn time). But if the broker can memorize its decision
Time-related stationary characteristics in queueing system with constant service time under hysteretic policy to probability distribution (in terms of Laplace-Stieltjes transform) of system's
sojourn time in different modes
Stationary distribution of waiting time in MAP/G/1/N queueing system with LIFO service discipline research we focus on investigating the stationary distribution of waiting (
sojourn)
time in the system