共查询到20条相似文献,搜索用时 15 毫秒
1.
The steady-state workload at an arbitrary time is considered for several single-server queueing systems with nonpreemptive services for multiple classes of customers (arriving according to Poisson processes) and server vacation (switchover) times. The distribution of the workload at an arbitrary point during the vacation period is obtained for systems with setup times, and for polling systems with exhaustive, gated, or globally gated service disciplines. From the stochastic decomposition property, this workload is added to the workload in the corresponding M/G/1 system without vacations to give the workload at an arbitrary time in vacation systems. Dependence of the workload distribution on the vacation parameters is studied. 相似文献
2.
This article is devoted to the study of an M/G/1 queue with a particular vacation discipline. The server is due to take a vacation as soon as it has served exactly N customers since the end of the previous vacation. N may be either a constant or a random variable. If the system becomes empty before the server has served N customers, then it stays idle until the next customer arrival. Such a vacation discipline arises, for example, in production systems and in order picking in warehouses. We determine the joint transform of the length of a visit period and the number of customers in the system at the end of that period. We also derive the generating function of the number of customers at a random instant, and the Laplace–Stieltjes transform of the delay of a customer. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 646–658, 2015 相似文献
3.
提出了随机服务系统的服务能力问题,给出有限服务能力的损失制M/M/1模型的描述和其稳态解,并求出了评价系统运行的几个主要数量指标。 相似文献
4.
Stig I. Rosenlund 《海军后勤学研究》1978,25(1):107-119
The busy period, busy cycle, and the numbers of customers served and lost therein, of the G/M/m queue with balking is studied via the embedded Markov chain approach. It is shown that the expectations of the two discrete variables give the loss probability. For the special case G/M/1/N a closed expression in terms of contour integrals is obtained for the Laplace transform of these four variables. This yields as a byproduct the LIFO waiting time distribution for the G/M/m/N queue. The waiting time under random order service for this queue is also studied. 相似文献
5.
Nasser Hadidi 《海军后勤学研究》1974,21(4):659-662
The output of the queueing system M/M/1 is well known to be Poisson. This has also been shown to be true for other more general models inclusive of M/Mn/1; the system in which arrivals and epochs of service completion are elements of a birth and death process with parameters Λ and nμ, respectively, when the system contains n ≥ 1 customers. We shall here show that this result is not true in MnM/1; a system where arrival parameter is state dependent quantity Λ/n+1. Expressions will be given for the steady state joint density of two consecutive output intervals as well as the coefficient of correlation between them. 相似文献
6.
7.
Shun-Chen Niu 《海军后勤学研究》1981,28(3):497-501
AnM/G/1 queueing system is studied in which the service time required by a customer is dependent on the interarrival time between his arrival and that of his predecessor Assuming the two variables are “associated,” we prove that the expected delay in this system is less than or equal to than of a conventional M/G/1 queue This conclusion has been verified via simulation by Mitchell and Paulson [9] for a special class of dependent M/M/1 queue. Their model is a special case of the one we consider here. We also study another modified GI/G/1 queue. where the arrival process and/or the service process are individually “associated”. 相似文献
8.
论述了排队系统与Stateflow相关概念,利用有限状态机理论与面向对象编程思想,提出了建立基于Stateflow排队系统模型的分析步骤,阐述了应用Stateflow对排队系统进行建模与仿真的方法,使用Stateflow对M/M/1/∞/∞/FIFO类型排队系统进行了具体的建模与仿真。仿真结果表明,基于Stateflow的模型与仿真能够有效地描述排队系统的统计特性,并具有可视化、流程化和层次化的特点。 相似文献
9.
The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of the M/G/1$ retrial queue. The structure of the busy period and its analysis in terms of Laplace transforms have been discussed by several authors. However, this solution has serious limitations in practice. For instance, we cannot compute the first moments of L by direct differentiation. This paper complements the existing work and provides a direct method of calculation for the second moment of L. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 115–127, 2000 相似文献
10.
三值光学计算机的运算请求处理过程缺乏合理、系统的性能评价标准与体系。基于M/M/1、M/M/n、MX/M/1和M/MB/1构成的复杂排队系统,构建了三值光学计算机的四阶段服务模型,同时建立了立即调度和结束时调度两种不同策略与算法。基于不同排队系统讨论了运算请求的接收时间、预处理时间、运算时间和发送时间的计算方法,进而得到最终响应时间。最后,通过仿真实验对两种策略的模型进行验证,结果表明结束时调度策略明显优于立即调度策略。 相似文献
11.
唐金国 《情报指挥控制系统与仿真技术》2010,(2):1-5,10
结合C^3I/M&S互操作性的主要问题,总结了互操作性技术参考模型,在此基础上对C^3I/M&S互操作性的数据模型及标准、接口标准进行了详细论述,介绍了北约C^3I/SIM互操作性试验情况,并指出了未来C^3I/M&S互操作性研究的发展趋势,对军队C^3I系统和仿真系统的建设有一定的指导意义。 相似文献
12.
In this study we deal with the determination of optimal service rate in an M/M/1 queue. The arrival rate is unknown and assumed to be a random variable with a known distribution function. Holding and operating costs are considered and service rate is determined to minimize total expected discounted costs for infinite horizon. The effects of the arrival rate's distribution properties on the characteristics of the system are examined. 相似文献
13.
14.
This article investigates optimal static prices for a finite capacity queueing system serving customers from different classes. We first show that the original multi‐class formulation in which the price for each class is a decision variable can be reformulated as a single dimensional problem with the total load as the decision variable. Using this alternative formulation, we prove an upper bound for the optimal arrival rates for a fairly large class of queueing systems and provide sufficient conditions that ensure the existence of a unique optimal arrival rate vector. We show that these conditions hold for M/M/1/m and M/G/s/s systems and prove structural results on the relationships between the optimal arrival rates and system capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
15.
In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000 相似文献
16.
A service center to which customers bring failed items for repair is considered. The items are exchangeable in the sense that a customer is ready to take in return for the failed item he brought to the center any good item of the same kind. This exchangeability feature makes it possible for the service center to possess spares. The focus of the article is on customer delay in the system—the time that elapses since the arrival of a customer with a failed item and his departure with a good one—when repaired items are given to waiting customers on a FIFO basis. An algorithm is developed for the computation of the delay distribution when the item repair system operates as an M/M/c queue. 相似文献
17.
Richard F. Gebhard 《海军后勤学研究》1967,14(1):55-67
The purpose of this paper is to analyze the effect of a particular control doctrine applied to the service mechanism of a queuing process. A bilevel hysteretic control based on queue length control levels is employed in an M/M/1 queuing system. Expressions are obtained for queue length probabilities, the first two factorial moments of queue length and two figures of merit for describing control performance under the assumption of statistical equilibrium. Computational examples illustrate the effects on queuing processes subject to this type of control. Several cost formulae are considered for comparison of costs when the queue control doctrine is varied. Situations in which hysteretic control is useful are discussed. 相似文献
18.
M/G/1(RVT,P(j))表示服务员具有随机长度休息时间(RVT)的、且一休息时间结束时有 j 个顾客等待的概率为 P(j)的、修正的 M/G/1 排队系统。我们用嵌入 Markov 链的技术已详细地分析过这一排队系统,这里提供另一分析方法。最后,应用这个排队系统的分析结果,对时隙 ALOHA 卫星公用信道的分组碰撞概率计算公式作了推导。 相似文献
19.
20.
在经典GI/M/c排队中引入部分服务台同步多重休假策略,利用拟单生过程和矩阵几何解的方法,求解系统的稳态队长分布及其条件随机分解。 相似文献