The Basic Multiple-Server-With-Priority Queuing Model Assumes That

Multiple Choice

The basic multiple-server-with-priority queuing model assumes that:

A) arrival rates are exponentially distributed.
B) service times are Poisson distributed.
C) items are serviced in order of arrival.
D) items are serviced in order of priority class.
E) service activities are pre-emptive.