The Discussion Of Several Problems In Queuing Systems

This paper begins with the daily case , respectively and then introduces the multicustomer arriving corresponding to multiservice queuing system . We make simple discussion on the simple case that 2-customer arriving corresponding to 2-service queuing, draw the state transferring picture , write the state transferring equations and make some analysis on them using probability generating function. Then we introduce the server helping strategy and obtain the general state transferring equation. Using the conditionλ1 =λ2 =λ,μ1 =μ2=μ, we obtain the same result as reference 1 and 2.This suggests that server integtion and server helping are the same thing.By the case that comparing the huge-server and n independent mini-server and the strategy that the servers help each other will optimalize the queuing system, we pose the question that if we parallel the n mini-server, we get two cases: one huge-server (case I) and n paralleling mini-server (case II).Then which is optimal? We compare them in the unlimited case and obtain that the case I dominates case II under some conditions. We also make further discussion under some other conditions and obtain some simple results.Finally we compare the M / H k/1 and M / M /1 queuing systems and some simple results are obtained.