A single-server finite-capacity queueing system with Markov flow and discrete-time service-server finite-capacity
queueing system with Markov flow and discrete-time service is studied. An algorithm
A queueing system with negative claims and a bunker for superseded claims in discrete timeWe consider a discrete time single-line
queueing system with independent geometric streams
Comparison of two active queue management schemes through the M/D/1/N queue performance characteristics of single-server
queues with the general renovation mechanism may be as good
Optimal control of queueing systems with heterogeneous serversAn optimal policy to minimize the
queue length in a multi-server controllable
queueing system Dispatching to two parallel nonobservable queues using only static information single server
queueing systems each with an infinite capacity
queue. There is one dispatcher, which
STATIONARY CHARACTERISTICS OF THE GI/MSP/N/∞ QUEUE WITHGENERAL RENOVATIONConsideration is given to the GI/MSP/n/∞
queue with the general renovation mechanism. General
Queueing systems with general renovationMulti-server
queueing systems with complete and general renovation are revised. Such models