On a GI/M/c queue with bounded waiting times
Operations Research
Busy period distribution in state-dependent queues
Queueing Systems: Theory and Applications
The Fourier-series method for inverting transforms of probability distributions
Queueing Systems: Theory and Applications - Numerical computations in queues
A direct approach to the GI/G/1 queueing system with finite capacity
Operations Research
Clearing Models for M/G/1 Queues
Queueing Systems: Theory and Applications
The M/G/1 Queue with Finite Workload Capacity
Queueing Systems: Theory and Applications
UPPER FIRST-EXIT TIMES OF COMPOUND POISSON PROCESSES REVISITED
Probability in the Engineering and Informational Sciences
PRODUCTION-INVENTORY MODELS WITH AN UNRELIABLE FACILITY OPERATING IN A TWO-STATE RANDOM ENVIRONMENT
Probability in the Engineering and Informational Sciences
ACTUARIAL VALUATION OF PERISHABLE INVENTORY SYSTEMS
Probability in the Engineering and Informational Sciences
Queueing Systems: Theory and Applications
Moments of the duration of busy periods of mx/g/1/n systems
Probability in the Engineering and Informational Sciences
Busy period analysis for M/PH/1 queues with workload dependent balking
Queueing Systems: Theory and Applications
The stationary workload of the G/M/1 queue with impatient customers
Queueing Systems: Theory and Applications
The idle period of the finite G/M/1 queue with an interpretation in risk theory
Queueing Systems: Theory and Applications
Algorithms for computing moments of the length of busy periods of single-server systems
ICCOMP'06 Proceedings of the 10th WSEAS international conference on Computers
Queueing Systems: Theory and Applications
A G/M/1 queueing system with PλM-service policy
Operations Research Letters
Duality of dams via mountain processes
Operations Research Letters
Workload and busy period for $$M/GI/1$$M/GI/1 with a general impatience mechanism
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We consider two models of M/G/1 and G/M/1 type queueing systems with restricted accessibility. Let (V(t))"t"="0 be the virtual waiting time process, let S"n be the time required for a full service of the nth customer and let @t"n be his arrival time. In both models there is a capacity bound v^*@?(0,~). In Model I the amount of service given to the nth customer is equal to min[S"n,v^*-V(@t"n-)], i.e. the full currently free workload is assigned to the new customer. In Model II the customer is rejected iff the currently used workload V(@t"n-) exceeds v^*, but the service times of admitted customers are not censored. We obtain closed-form expressions for the Laplace transforms of the lengths of the busy periods.