助手标题
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
共[2022]条 当前为第1条到20条[由于搜索限制,当前仅支持显示前5页数据]
 

相关语句
customers
Primary customers get in the system according to a Poisson process, and they will receive service immediately if the server is available upon arrival.
      
Customers are allowed to balk and renege at particular times.
      
All customers demand the first "essential" service, whereas only some of them demand the second "multi-optional" service.
      
It adopts Web technology to enable customers to individually customize products remotely through the internet.
      
Single-server queueing systems with Markov flow of customers, one waiting place, and preemptive-resume service and LCFS discipline for customers differing in behavior after interruption are studied.
      
A disaster may completely empty the system, i.e., all customers, including the customer under service, may quit the system.
      
On the assumption of the Poisson flow of customers at the rate depending on the price and the time up to the end of the utility date, a method of maximization of an appropriate functional is worked out.
      
The stationary distribution of the number of customers and the loss probability for a BMAP/SM/1/N system are computed.
      
A queueing network with an input flow of signals, along with a flow of ordinary (positive) customers, at its nodes is studied.
      
Invariance of the Stationary Distribution of Networks with Bypasses and "Negative" Customers
      
The nodes of the first type are characterized by bypasses, those of the second type, by the possibility of arrival of "negative" customers.
      
Servicing of the "positive" customers is done in the nodes according to the FCFS discipline.
      
"Positive" and "negative" customers make up simplest flows.
      
A multi-server queueing system with a semi-Markov input flow of two types of customers, Markov service, a common buffer of finite capacity, and random-service discipline is investigated.
      
A Queueing System with Inverse Discipline, Two Types of Customers, and Markov Input Flow
      
The dead time and parameters of an asynchronous double stochastic event flow, which is the model for information flows of customers (events) in queueing systems and networks, are estimated.
      
For a system with several heterogeneous servers, the well-known Howard algorithm was used to study numerically whether the optimal servicing disciplines satisfy the criterion for minimum stationary number of customers in system.
      
The G-networks primarily differ from the Jackson and BCMP networks in that they additionally contain a flow of the so-called negative customers and/or triggers.
      
When a negative customer arrives at a network node, one or a batch of positive (ordinary) customers is killed (annihilated, displaced), whereas a trigger displaces a positive customer from the node to some other node.
      
Decomposition of Queueing Networks with Dependent Service and Negative Customers
      
 

首页上一页12345下一页尾页 

 
CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社