排课中时间表问题的探讨

提出一种时间表的设计方案及其改进形式,讨论了它的相关性能。应用本方案,不仅可以提高排课中搜索的效率(最高可达(2n 1)/2倍),还可以满足排课过程中对时间的各种需求,具有很强的适应性和可移植性;再利用层次分析法得到各时间段的可接受度,分析了使用改进时间表的公平性,其公平性因子将得到成倍提高。     

概率条件下雷区范围估计研究

为更正现有雷区范围估计算法因搜扫率处置不当而存在的矛盾与不足,研究了搜扫率条件下的雷区范围估计问题。分不规则雷区和规则雷线两种情况,依据极大似然估计的原理,推导出搜扫率条件下的雷区范围估计算法,并对改进算法与现有算法进行了分析比较和仿真示例验证。分析和示例表明新算法克服了现有算法的缺陷,能够更符合实际地解决雷区范围估计问题。     

美军频谱认证过程研究

对美军频谱认证过程(DOD SCP)进行了研究,分析了美军频谱认证过程提出的原因和频谱认证中各机构的角色定位、相互关系以及操作流程,分析了美军频谱认证过程实施中遇到的问题,总结了美军解决这些问题采取的措施,分析了美军2007年新的国防频谱管理战略计划的主要特点和战略取向,分析了美军全球电磁信息系统(GEMSIS)的目标和主要特点,分析了联合构想2020(Joint Vision 2020)计划各部分之间的关系,提出了对我国频谱管理的启示。     

关于半鞅向量随机积分的一个注

建立了半鞅向量随机积分的一个结果,能方便处理可料过程在向量随机积分意义下对半鞅的分解随可料过程不同而不同的问题.作为其应用,给出了有关文献中定理的简洁证明.并利用其思想,得到了半鞅向量随机积分的一个重要性质.     

作战应用软件评测指标及方法研究

作战应用软件装备部队前进行黑盒评测必须以规格需求为基础。根据作战应用软件的功能区分,提出了作战应用软件评测指标确定的原则和依据,建立了评测的指标体系,给出了评测方法。应用层次分析法自底向上对各级指标属性值进行计算,并对计算方法进行了分析。所用的评测指标体系和评测方法适用于各军种兵种作战应用软件评测,具有通用性特点。     

Reliability inference for field conditions from accelerated degradation testing

Accelerated degradation testing (ADT) is usually conducted under deterministic stresses such as constant‐stress, step‐stress, and cyclic‐stress. Based on ADT data, an ADT model is developed to predict reliability under normal (field) operating conditions. In engineering applications, the “standard” approach for reliability prediction assumes that the normal operating conditions are deterministic or simply uses the mean values of the stresses while ignoring their variability. Such an approach may lead to significant prediction errors. In this paper, we extend an ADT model obtained from constant‐stress ADT experiments to predict field reliability by considering the stress variations. A case study is provided to demonstrate the proposed statistical inference procedure. The accuracy of the procedure is verified by simulation using various distributions of field stresses. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

Optimal pricing and inventory control policy in periodic‐review systems with fixed ordering cost and lost sales

This paper studies a periodic‐review pricing and inventory control problem for a retailer, which faces stochastic price‐sensitive demand, under quite general modeling assumptions. Any unsatisfied demand is lost, and any leftover inventory at the end of the finite selling horizon has a salvage value. The cost component for the retailer includes holding, shortage, and both variable and fixed ordering costs. The retailer's objective is to maximize its discounted expected profit over the selling horizon by dynamically deciding on the optimal pricing and replenishment policy for each period. We show that, under a mild assumption on the additive demand function, at the beginning of each period an (s,S) policy is optimal for replenishment, and the value of the optimal price depends on the inventory level after the replenishment decision has been done. Our numerical study also suggests that for a sufficiently long selling horizon, the optimal policy is almost stationary. Furthermore, the fixed ordering cost (K) plays a significant role in our modeling framework. Specifically, any increase in K results in lower s and higher S. On the other hand, the profit impact of dynamically changing the retail price, contrasted with a single fixed price throughout the selling horizon, also increases with K. We demonstrate that using the optimal policy values from a model with backordering of unmet demands as approximations in our model might result in significant profit penalty. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Requirements planning for modular products

The focus of this paper is on determining the requirements of different component options of a modular end‐product in an uncertain environment. We explicitly model two distinct sources of uncertainty: stochastic end‐product demand and unknown market proportions for the different product options available. Our cost minimizing model focuses on determining the optimal requirements policies for component options that meet a pre‐set service level. We show that simple common‐sense requirements policies are not generally optimal; there is a non‐linear connection between service level and component requirements that is hard to characterize without a detailed analysis. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于供应链管理的战时装备供应保障业务流程重组

从战时装备供应链管理的要素和相互关系出发,结合我军实际,提出了基于供应链的战时装备供应保障业务流程重组过程,并对相关方法进行了讨论,旨在使战时所需装备以可预见的方式快速、安全、准确地送抵到作战部队。     

Dynamic policy for idling time preservation

This study aims to determine and evaluate dynamic idling policies where an agent can idle while some customers remain waiting. This type of policies can be employed in situations where the flow of urgent customers does not allow the agent to spend sufficient time on back-office tasks. We model the system as a single-agent exponential queue with abandonment. The objective is to minimize the system's congestion while ensuring a certain proportion of idling time for the agent. Using a Markov decision process approach, we prove that the optimal policy is a threshold policy according to which the agent should idle above (below) a certain threshold on the queue length if the congestion-related performance measure is concave (convex) with respect to the number of customers present. We subsequently obtain the stationary probabilities, performance measures, and idling time duration, expressed using complex integrals. We show how these integrals can be numerically computed and provide simpler expressions for fast-agent and heavy-traffic asymptotic cases. In practice, the most common way to regulate congestion is to control access to the service by rejecting some customers upon arrival. Our analysis reveals that idling policies allow high levels of idling probability that such rejection policies cannot reach. Furthermore, the greatest benefit of implementing an optimal idling policy occurs when the objective occupation rate is close to 50% in highly congested situations.