Inventory policies with quantized ordering

This article studies (nQ, r) inventory policies, under which the order quantity is restricted to be an integer multiple of a base lot size Q. Both Q and r are decision variables. Assuming the one-period expected holding and backorder cost function is unimodal, we develop an efficient algorithm to compute the optimal Q and r. The algorithm is facilitated by simple observations about the cost function and by tight upper bounds on the optimal Q. The total number of elementary operations required by the algorithm is linear in these upper bounds. By using the algorithm, we compare the performance of the optimal (nQ, r) policy with that of the optimal (s, S) policy through a numerical study, and our results show that the difference between them is small. Further analysis of the model shows that the cost performance of an (nQ, r) policy is insensitive to the choice of Q. These results establish that (nQ, r) models are potentially useful in many settings where quantized ordering is beneficial.     

四支板超声速引射器性能特性试验

对二维喷管构型的四支板超声速引射器进行冷流试验,分析启动、负载匹配方面的性能特性。试验结果表明:启动特性方面,四支板超声速引射系统的盲腔压力低于3 kPa,引射器入口腔压的迟滞压力比启动压力低15.9%。负载匹配特性方面,四支板引射器在小引射系数、大增压比状态下具有十分明显的优势,当引射系数为0.04时,增压比为11.21;当引射系数为0.10时,增压比为7.0。因此,二维喷管构型的多支板超声速引射器具有良好的启动、负载匹配性能,工程应用潜力较大。     

Energy‐efficient scheduling for sustainable manufacturing systems with renewable energy resources

Environmentally friendly energy resources open a new opportunity to tackle the problem of energy security and climate change arising from wide use of fossil fuels. This paper focuses on optimizing the allocation of the energy generated by the renewable energy system to minimize the total electricity cost for sustainable manufacturing systems under time‐of‐use tariff by clipping the peak demand. A rolling horizon approach is adopted to handle the uncertainty caused by the weather change. A nonlinear mathematical programming model is established for each decision epoch based on the predicted energy generation and the probability distribution of power demand in the manufacturing plant. The objective function of the model is shown to be convex, Lipchitz‐continuous, and subdifferentiable. A generalized benders decomposition method based on the primal‐dual subgradient descent algorithm is proposed to solve the model. A series of numerical experiments is conducted to show the effectiveness of the solution approach and the significant benefits of using the renewable energy resources.     

Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

Single‐machine scheduling with deadlines to minimize the total weighted late work

We consider scheduling a set of jobs with deadlines to minimize the total weighted late work on a single machine, where the late work of a job is the amount of processing of the job that is scheduled after its due date and before its deadline. This is the first study on scheduling with the late work criterion under the deadline restriction. In this paper, we show that (i) the problem is unary NP‐hard even if all the jobs have a unit weight, (ii) the problem is binary NP‐hard and admits a pseudo‐polynomial‐time algorithm and a fully polynomial‐time approximation scheme if all the jobs have a common due date, and (iii) some special cases of the problem are polynomially solvable.     

维修性增长趋势检验研究

对即时改进和延缓改进两种维修性增长规划方式进行了趋势检验研究.针对即时改进的维修性增长规划方式,提出了趋势检验的图示法和Laplace方法.针对延缓改进的维修性增长规划方式,根据修复率(第i阶段的修复率为μi)的顺序约束条件:∞>μm≥…≥μi≥…≥μ2≥μ1>0,探讨了指数分布和正态分布维修性增长趋势检验的区间估计法,并结合数值例说明了这些方法的可行性.     

基于multi-agent编组的校园虚拟实验网格任务分配策略

在网格计算环境下,许多任务的执行经常需要同时协同分配多个agent以满足性能需求.提出了一种新的基于multi-agent编组机制的agent协同分配方法.首先,对传统编组算法和multi-agent编组算法进行了分析比较.然后,设计了校园虚拟实验网格调度系统及其任务分配算法,实验结果表明:当CDR=0.2时,算法与传统算法带来最好的目标价值,在某些条件下,传统算法略微胜过该算法,当CDR增大时,该算法比传统算法执行得更好.     

基于位置信息的无线传感网络路由改进

基于位置信息的无线传感器网络如果完全采用无状态的方式路由,在某些拓扑结构中存在数据不可到达的缺陷,即死亡点的问题.针对这一问题,将无线传感器网络抽象为一数学模型,在此模型的基础上,给出了问题的数学描述.经分析,提出了一种基于逃离算法的详细解决方案.对算法的性能从理论上分析得出算法没有环路,是正确可行的,而仿真结果也验证了这一点,算法的时间复杂度为O(n).     

固体燃料冲压发动机两种内旁路构型燃烧性能数值分析

使用数值模拟方法对比分析了环型通道与齿轮型通道两种内旁路构型的燃烧性能,固体燃料为丁羟,燃烧采用总包反应,反应速率由涡团耗散模型计算.研究发现,环型通道在补燃室头部产生突扩回流区,仍为扩散燃烧;齿轮型通道在补燃室头部产生对称的涡结构,能够增强未燃烧燃料与旁路空气的掺混效果,且总压损失与环型相当,综合燃烧性能较好.     

海军作战指挥综合仿真系统

在分析作战仿真的基本概念和应用领域的基础上,描述了作战仿真系统的军事需求,提出了海军作战指挥综合仿真系统的总体设计要求,分析了仿真系统的体系结构、组成及运行方式,阐述了仿真系统研究中的主要关键技术和应用方向.为海军新型作战指挥系统的研制建立了一个集成综合作战仿真系统.