We consider the problem of simultaneously allocating servers and demands in a service system with independent multiple facilities. We assume a fixed number of facilities and total servers which must service a given Poisson arrival stream. We also assume that service times are identically...

Consider a system with N processors and two job types with one having preemptive priority over the other. Arrivals are Poisson and service times are exponential. We present two approaches for modeling the system. The difference between the two lies in the order with which we list the numbers of...

A new variant of a branching process is introduced, with sufficient conditions for it to persist and to die out. The model is applied to discuss the asymptotic stability of a new type of queuing process.

We examine the relative effects of several service order disciplines on important operating characteristics of queues in which customers request a random number of servers. This class of queues is characterized by customers who cannot begin service until all required servers are available. We...

In a G/G/c/N system (a queue with general distributions of inter-arrival and service time, c servers and N - c \ge 0 queueing positions), let B be the steady-state probability that an arriving customer finds all queue positions filled and p be the time average probability that all queue...