排序方式: 共有86条查询结果,搜索用时 375 毫秒
71.
This article generalizes the models in Guo and Zipkin, who focus on exponential service times, to systems with phase‐type service times. Each arriving customer decides whether to stay or balk based on his expected waiting cost, conditional on the information provided. We show how to compute the throughput and customers' average utility in each case. We then obtain some analytical and numerical results to assess the effect of more or less information. We also show that service‐time variability degrades the system's performance. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
72.
73.
74.
75.
本文以带宽Toeplitz系统的快速并行解法为基础,通过建立秩1的修正格式讨论了拟带宽Toeplitz系统的一种快速并行算法,其串行运算量为9nh+O(h).设p为处理机台数,当p≤n时,并行运算量为 ;当p=3n时,运算量为2h ̄2log2n+O(1),其中h表示拟带宽宽度。 相似文献
76.
就正态圆分布的武器命中精度的截尾序惯验后加权检验犯两类错误概率上界的计算问题,指出了目前沿用的计算公式的错误,推导了新的计算公式,并给出了算例,分析了计算结果的合理性;同时,指出了目前截尾点选取方法存在的问题 相似文献
77.
讨论了Laplaoe分布中,方差已知的情况下,均值θ在简单半序约束下的最小L_1保序回归(ML_1IR),就最小L_1保序回归的唯一性以及一些其它性质予以了讨论,并且给出了计算方法。 相似文献
78.
军事素质基础综合训练的改革与实践研究 总被引:1,自引:0,他引:1
以提高军事素质为核心,结合“4+1”培养模式对复合型军事人才的要求,对军事素质基础综合训练教学进行了改革。重点阐述了深化军事素质基础综合训练的教学改革特点和实践效果,为总装备部乃至全军院校进一步深化军事基础教学改革提供一些思路和参考。 相似文献
79.
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 相似文献
80.
In a multifunction radar, the maximum number of targets that can be managed or tracked is an important performance measure. Interleaving algorithms developed to operate radars exploit the dead‐times between the transmitted and the received pulses to allocate new tracking tasks that might involve transmitting or receiving pulses, thus increasing the capacity of the system. The problem of interleaving N targets involves a search among N! possibilities, and suboptimal solutions are usually employed to satisfy the real‐time constraints of the radar system. In this paper, we present new tight 0–1 integer programming models for the radar pulse interleaving problem and develop effective solution methods based on Lagrangian relaxation techniques. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献