排序方式: 共有86条查询结果,搜索用时 0 毫秒
1.
R.E. Lillo 《海军后勤学研究》2001,48(3):201-209
An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001 相似文献
2.
针对电子对抗装备天线伺服系统驱动器可用度评估问题,考虑其具有优先使用权冷贮备冗余设计的特点,运用马尔可夫过程分析的方法,研究修理工人数不同情况下伺服驱动器稳态可用度和瞬时可用度,建立相应的数学模型,最后进行实例验证,绘出不同维修策略下系统瞬时可用度随时间变化的曲线. 相似文献
3.
基于Vague集的TOPSIS法求解目标优先级 总被引:1,自引:0,他引:1
针对传感器管理中目标—传感器配对出现的目标优先级求解问题,提出了一种基于Vague集的TOPSIS计算方法。在分析目标优先级的主要影响因素基础上,定义了各影响因素的影响系数。同时结合Vague集的TOPSIS法给出了目标优先级的计算步骤,为目标优先级求解提供了一种新途径。并结合仿真算例表明该方法的合理性与有效性。 相似文献
4.
傅刚 《武警工程学院学报》2013,(6):24-27
随着社会发展对消防安全的要求越来越高,实时地采集传输监测数据变得至关重要Ⅲ。本文针对现存的烟雾传感器节点可靠性差、准确率低、电路复杂,不易组网,并且在很多特定区域无法安装等问题,提出了基于CC2530的烟雾监测节点设计方案,并完成了以CC2530射频芯片为核心的烟雾传感器节点的硬、软件设计。实验测试证明,该节点满足无线消防监测系统的需要,具有高可靠性、低功耗以及低成本的特点,有着较好的应用前景。 相似文献
5.
摘要:针对单小批量武器装备保障的特殊需求,对传统的质量屋模型进行了改进,建立了基于装备保障需求与保障规则的质量屋模型,利用整数规划技术进行求解,使得单小批量武器的装备保障规则按照实际保障需求重新排列优先次序,并通过对某型火炮保障方案的筛选验证了模型的正确性.新的质量屋模型发展完善了质量屋的理论与方法,有助于提高单小批量武器的装备保障能力. 相似文献
6.
7.
8.
9.
10.