Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems

In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015     

基于非均匀调制函数模型的非平稳地震动模拟

通过对地震动演变谱模型化分析,在精确估计地震动时变功率谱的基础上,利用多元函数目标优化方法识别地震动的非均匀调制函数模型参数,从而建立了基于非均匀调制函数模型的时频非平稳地震动模拟方法。对给定初始地震波和直接给定模型参数2个算例的分析表明,应用本文方法模拟的地震波可以较好实现时频非平稳,而且对目标反应谱也具有较好的拟合精度。     

对合成孔径雷达的转发式扫频干扰技术研究

对合成孔径雷达( SAR)的干扰技术进行了系统的研究,在对余弦转发式干扰和伪装遮盖干扰进行详细理论分析和计算机仿真的基础上提出了一种新的干扰方法——转发式扫频干扰,该方法通过转发调制了扫频信号的SAR回波,使得SAR回波在距离向频域不能实现压缩,破坏了合成孔径雷达的自聚焦能力.理论研究表明,这几种方法均可以在低干信比的条件对SAR进行有效干扰,使其不能成像,从而达到掩护分布式目标的目的.通过对汽车模型成像的干扰仿真,验证了这些方法的有效性和可行性.     

一类具有时滞和捕获的食物链模型的周期解

研究一类具有时滞和捕获的食物链模型,借助重合度理论中的Mawhin延拓引理,得到了保证系统至少存在8个正周期解的充分条件。     

具有脉冲和Holling IV类功能反应的三维捕食系统

建立了在固定时刻具有脉冲效应的三维捕食系统,利用常微分方程比较原理、含脉冲的比较原理及Lyapunov函数方法,得到了该系统的持续生存性、周期解的存在唯一性和全局吸引性,并给出了保持这些性质时脉冲项应满足的界限.     

周期生存的血红细胞模型的周期解

本文研究了如下周期生存的带有反馈控制的有时滞血红细胞模型dx(dtt)=-b(t)x(t)+β(t)e-x(t-τ(t))+c(t)u(t-δ(t)),dud(tt)=-η(t)u(t)+α(t)x(t-σ(t))的周期解的存在性,给出了正周期解存在的充分条件。     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001     

一类具有时滞和常数收获率的比率型功能性反应的捕食-被捕食模型的稳定性与Hopf分支

研究一类具有时滞和常数收获率的比率型功能性反应的捕食—被捕食模型。首先,分析了模型奇点的类型,研究了正平衡点的局部稳定性以及Hopf分支的存在性;然后应用中心流形和规范型理论,得到了关于确定Hopf分支方向和分支周期解稳定性的计算公式;最后,应用Matlab软件对所得理论结果进行了数值模拟。