AbstractWe consider an M/G/1 queueing system under PλM-service policy. As soon as the workload exceeds threshold λ>0, the service rate is increased from 1 to M⩾1 and is kept until the system becomes empty. After assigning several costs, we show that there exists a unique M minimizing the long-run average cost per unit time
For a single server loss system with finite waiting room with Poisson arrivals and deterministic ser...
We analyzed an M/M/R queueing system with finite capacity N where customers have multiple classes wi...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
AbstractWe consider an M/G/1 queueing system under PλM-service policy. As soon as the workload excee...
textabstractWe consider a queueing system with a workload-dependent service rate. We specifically as...
Consider an M/M/1 queueing system with server vacations where the server is turned ooe as soon as th...
AbstractA cost function is studied for an M/G/1 queueing model for which the service rate of the vir...
An optimal policy to minimize the queue length in a multi-server controllable queueing system with h...
We consider an M/M/R queueing system with finite capacity N, where customers have two arrival modes ...
We study a generalised M(k)/M/k queueing system where the arrival rate depends on the number of serv...
We consider anM/G/1 queueing system where the speed of the server depends on the amount of work pres...
The paper is concerned with the optimal control with respect to N-policy of the M/M/1 queue with con...
AbstractThis paper investigates the T policy M/G/1 queue with server breakdowns, and startup times. ...
\u3cp\u3eIn modern data centers, the trade-off between processing speed and energy consumption is an...
We extend the validity of some results on the optimal control of two-server queueing models with ser...
For a single server loss system with finite waiting room with Poisson arrivals and deterministic ser...
We analyzed an M/M/R queueing system with finite capacity N where customers have multiple classes wi...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
AbstractWe consider an M/G/1 queueing system under PλM-service policy. As soon as the workload excee...
textabstractWe consider a queueing system with a workload-dependent service rate. We specifically as...
Consider an M/M/1 queueing system with server vacations where the server is turned ooe as soon as th...
AbstractA cost function is studied for an M/G/1 queueing model for which the service rate of the vir...
An optimal policy to minimize the queue length in a multi-server controllable queueing system with h...
We consider an M/M/R queueing system with finite capacity N, where customers have two arrival modes ...
We study a generalised M(k)/M/k queueing system where the arrival rate depends on the number of serv...
We consider anM/G/1 queueing system where the speed of the server depends on the amount of work pres...
The paper is concerned with the optimal control with respect to N-policy of the M/M/1 queue with con...
AbstractThis paper investigates the T policy M/G/1 queue with server breakdowns, and startup times. ...
\u3cp\u3eIn modern data centers, the trade-off between processing speed and energy consumption is an...
We extend the validity of some results on the optimal control of two-server queueing models with ser...
For a single server loss system with finite waiting room with Poisson arrivals and deterministic ser...
We analyzed an M/M/R queueing system with finite capacity N where customers have multiple classes wi...
A class of dynamic control policies is defined for scheduling customers from a Poisson source on a s...
DOI
Add to ORKG