优化目标是零件在系统中平均排队时间最短。
The optimization object is to minimize components' average queueing time in the system.
在零件加工时间服从指数分布的假设下，根据排队论求出零件在系统中平均排队时间。
With the assumption that the component processing time is exponential distribution, components' average queueing time in the system was calculated by queueing theory.
换句话说，在资源不足以马上处理请求时，silver请求的平均排队时间是gold请求的两倍。
In other words, silver requests will, on average, spend twice as much time being queued as gold requests, when there are insufficient resources to immediately service the request.
在资源数量约束下，依次让各工序资源数量增一，使零件在系统中平均排队时间减少最大的工序首先分配资源。
With the constraint of resource quantity, resource is allocated to the procedure which decreases components' average queueing time most significantly with the same resource quantity increment.
在上面的示例中，考虑到排队时间和25ms的处理时间，平均请求服务时间最终会超过1.1秒。
In the example above, the average request time ends up being over 1.1 seconds once you factor in the queueing time and the 25ms processing time.
NET性能计数器中关于排队请求和平均等待时间的统计信息？
NET performance counters for stats regarding queued requests and average wait times?
排队，这个英联邦人民乐于去做的事情，总是出人意料地耗费时间。平均算下来，我们每周用于排队的时间就有33分钟。
Queuing, the GREat British pastime, is just as time-consuming as you had always suspected. On average, we spend 33 minutes a week standing in queues.
然而一方面，我们可能可以把这个数据与设备排队尺寸以及平均请求执行时间结合起来以得到一些合适的数值。
One however probably can combine this data with device queue sizes and average request execution time to get some decent values.
采用排队论理论对传感器网络性能进行分析，计算出平均等待时间，提高了传感器系统的可靠性。
Queuing theory is used to analyze th system performance and calculate the average waiting time which can improve the reliability of the system.
实验结果表明，该机制下排队任务的平均等待时间明显减少。
The experiment results show that the mean wait time of queued tasks decreases apparently in the mechanism.
建立了一个模糊控制器来决定排队系统信息流分配的最优策略，使得顾客在通信系统中的平均逗留时间最小。
A fuzzy controller is designed to decide the optimal tactic of distributing the information flow of the queue system, which makes the time of the clients delay least in the communication system.
再建立局部随机策略来计算堵塞时间，并应用排队论方法计算堵塞次数和平均堵塞时间。
Then, local stochastic strategy modeled to calculate interfering time. In addition, let queue to compute times of interference and average interfering time.
对此，从资源的角度出发，利用排队论提出了一种通用的工作流时间性能分析方法，其中采用工作流实例平均响应时间作为工作流时间性能的分析与评价的指标。
To solve this problem, a general method using queuing theory was proposed to analyze the time performance of a workflow running in such a workflow management system.
运用优先权排队理论计算了模型的平均等待时间、平均逗留时间以及低优先权顾客服务被打断的概率。
Through the priority queuing theory, the average waiting time, the average length of stay and the interrupted probability of low priority customer service are deduced and calculated.
运用优先权排队理论计算了模型的平均等待时间、平均逗留时间以及低优先权顾客服务被打断的概率。
Through the priority queuing theory, the average waiting time, the average length of stay and the interrupted probability of low priority customer service are deduced and calculated.
应用推荐