排序方式: 共有11条查询结果,搜索用时 15 毫秒
1.
This paper treats the analytical solution of the truncated interarrival hyperexponential queue. Hk/M/c/N with balking and reneging for general values of k,c and N. The discipline considered here is FIFO. Some previously published results are shown to be special cases of the present results 相似文献
2.
Consider a single-server queue with a Poisson arrival process and exponential processing times in which each customer independently reneges after an exponentially distributed amount of time. We establish that this system can be approximated by either a reflected Ornstein–Uhlenbeck process or a reflected affine diffusion when the arrival rate exceeds or is close to the processing rate and the reneging rate is close to 0. We further compare the quality of the steady-state distribution approximations suggested by each diffusion. 相似文献
3.
4.
本文讨论具有阻碍、放弃,不同服务员Kk/M/2/N排队系统的解析解.对经典的一种先入先出的修改排队规则在较一般的条件下被采用了,得到了稳态概率和一些有效度量的显式.一些特殊情况也被化简了。 相似文献
5.
We consider a system where incoming jobs may be executed at different servers, each of which goes through alternating periods
of being available and unavailable. Neither the states of the servers nor the relevant queue sizes are known at moments of
arrival. Hence, a load balancing mechanism that relies on random time-out intervals and job transfers from one queue to another
is adopted. The object is to minimize a cost function which may include holding costs and transfer costs. A model of a single
queue with an unreliable server and timeouts is analyzed first. The results are then used to obtain an approximate solution
for arbitrary number of queues. Several transfer policies are evaluated and compared. 相似文献
6.
Consider a single-server queue with a renewal arrival process and generally distributed processing times in which each customer independently reneges if service has not begun within a generally distributed amount of time. We establish that both the workload and queue-length processes in this system can be approximated by a regulated Ornstein-Uhlenbeck (ROU) process when the arrival rate is close to the processing rate and reneging times are large. We further show that a ROU process also approximates the queue-length process, under the same parameter assumptions, in a balking model. Our balking model assumes the queue-length is observable to arriving customers, and that each customer balks if his or her conditional expected waiting time is too large. 相似文献
7.
Motivated by the problem of organ allocation, we develop a queueing model with reneging that provides a stylistic representation
of the transplant waiting list. The model assumes that there are several classes of patients, several classes of organs, and
patient reneging due to death. We focus on randomized organ allocation policies and develop closed-form asymptotic expressions
for the stationary waiting time, stationary waiting time until transplantation, and fraction of patients who receive transplantation
for each patient class. Analysis of these expressions identifies the main factors that underlie the performance of the transplant
waiting list and demonstrates that queueing models can prove useful when evaluating the organ allocation system.
This revised version was published online in June 2006 with corrections to the Cover Date. 相似文献
8.
《Operations Research Letters》2021,49(2):212-217
We study a single station two-stage reneging queue with Poisson arrivals, exponential services, and two levels of exponential reneging behaviors, extending the popular Erlang A model that assumes a constant reneging rate. We derive approximate analytical formulas representing performance measures for our two-stage queue following the Markov chain decomposition approach. Our formulas not only give accurate results spanning the heavy-traffic to the light-traffic regimes, but also provide insight into capacity decisions. 相似文献
9.
研究了等待空间有限的两服务台可修排队系统,其中一个服务台可能故障.到达的顾客可能进入系统也可能不进入系统(止步),进入系统的顾客可能因等待的不耐烦而中途退出.利用马尔可夫过程的方法建立了系统稳态概率满足的方程组,通过分块矩阵推导出了系统稳态概率向量的迭代计算公式,由此得到了系统各项性能指标的计算公式.最后,给出了一些数值结果. 相似文献
10.
向顾客公布需等待的排队时间用以缓解系统拥挤是目前呼叫中心运营管理的重要手段之一。为了有效刻画等待提示策略下顾客行为变化对呼叫系统性能的影响,采用流体近似方法建立了呼叫排队系统模型。首先,通过排队分析构造等待提示影响下排队行为框架,包含带有心理行为变化特征的多种行为要素概率函数;其次,利用流体方法构建了考虑顾客重拨影响的连续排队模型,并求解了稳态条件下的系统性能指标;最后,通过与仿真模型的对比,验证了该流体近似方法的有效性与精确性。研究结果对于带有等待时间提示的呼叫中心运营具有重要指导作用。 相似文献