Capacitated lot‐sizing and scheduling with parallel machines,back‐orders,and setup carry‐over

We address the capacitated lot‐sizing and scheduling problem with setup times, setup carry‐over, back‐orders, and parallel machines as it appears in a semiconductor assembly facility. The problem can be formulated as an extension of the capacitated lot‐sizing problem with linked lot‐sizes (CLSPL). We present a mixed integer (MIP) formulation of the problem and a new solution procedure. The solution procedure is based on a novel “aggregate model,” which uses integer instead of binary variables. The model is embedded in a period‐by‐period heuristic and is solved to optimality or near‐optimality in each iteration using standard procedures (CPLEX). A subsequent scheduling routine loads and sequences the products on the parallel machines. Six variants of the heuristic are presented and tested in an extensive computational study. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

What you should know about approximate dynamic programming

Approximate dynamic programming (ADP) is a broad umbrella for a modeling and algorithmic strategy for solving problems that are sometimes large and complex, and are usually (but not always) stochastic. It is most often presented as a method for overcoming the classic curse of dimensionality that is well‐known to plague the use of Bellman's equation. For many problems, there are actually up to three curses of dimensionality. But the richer message of approximate dynamic programming is learning what to learn, and how to learn it, to make better decisions over time. This article provides a brief review of approximate dynamic programming, without intending to be a complete tutorial. Instead, our goal is to provide a broader perspective of ADP and how it should be approached from the perspective of different problem classes. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Performance and properties of Q‐Statistic monitoring schemes

In this article, we study the Shewhart chart of Q statistics proposed for the detection of process mean shifts in start‐up processes and short runs. Exact expressions for the run‐length distribution of this chart are derived and evaluated using an efficient computational procedure. The procedure can be considerably faster than using direct simulation. We extend our work to analyze the practice of requiring multiple signals from the chart before responding, a practice sometimes followed with Shewhart charts. The results show that waiting to receive multiple signals severely reduces the probability of quickly detecting shifts in certain cases, and therefore may be considered a risky practice. Operational guidelines for practitioners implementing the chart are discussed. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

综合体育馆消防性能化评估

体育馆属于空间结构复杂、人员密集的场所,在增加了一些新颖的设计元素后,通常会给建筑人员安全疏散带来困难。以山东大学体育馆为例,对于这些问题,通常采用比较先进的性能化设计和评估来解决。     

多车通信系统中的同频电子干扰消除优化方法

在多接口多信道车联网多车通信系统中,由于车辆的自组织特性和路网网格的不均衡性,产生同频电子干扰,对电子干扰的滤波消除能提高多车通信的信道均衡性,降低误码率。传统方法采用自适应陷波方法实现同频电子干扰消除,无法在突变的载波频率下消除同频电子干扰,导致性能差的问题。提出一种基于自适应线谱增强的多车通信系统中的同频电子干扰消除优化方法。首先构建多车通信系统,引入一种信噪干扰比的观点,对同频电子干扰进行信号模型构建,根据信号比容易分离的特点,使得模型可分离性变强,结合变步长自适应线谱增强方法,实现信号的分离过滤。仿真实验结果表明,进行同频电子干扰消除抑制处理后的功率谱收敛到信号的真实频率附近,多车通信信号能从背景色噪声中有效检测出来,降低了多车通信系统的误码率,展示了较好的信道均衡和改善能力,性能优越。     

A characterization of optimal base‐stock levels for a multistage serial supply chain

In this article, we present a multistage model to optimize inventory control decisions under stochastic demand and continuous review. We first formulate the general problem for continuous stages and use a decomposition solution approach: since it is never optimal to let orders cross, the general problem can be broken into a set of single‐unit subproblems that can be solved in a sequential fashion. These subproblems are optimal control problems for which a differential equation must be solved. This can be done easily by recursively identifying coefficients and performing a line search. The methodology is then extended to a discrete number of stages and allows us to compute the optimal solution in an efficient manner, with a competitive complexity. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 32–46, 2016     

Expansion planning for waste‐to‐energy systems using waste forecast prediction sets

We consider an expansion planning problem for Waste‐to‐Energy (WtE) systems facing uncertainty in future waste supplies. The WtE expansion plans are regarded as strategic, long term decisions, while the waste distribution and treatment are medium to short term operational decisions which can adapt to the actual waste collected. We propose a prediction set uncertainty model which integrates a set of waste generation forecasts and is constructed based on user‐specified levels of forecasting errors. Next, we use the prediction sets for WtE expansion scenario analysis. More specifically, for a given WtE expansion plan, the guaranteed net present value (NPV) is evaluated by computing an extreme value forecast trajectory of future waste generation from the prediction set that minimizes the maximum NPV of the WtE project. This problem is essentially a multiple stage min‐max dynamic optimization problem. By exploiting the structure of the WtE problem, we show this is equivalent to a simpler min‐max optimization problem, which can be further transformed into a single mixed‐integer linear program. Furthermore, we extend the model to optimize the guaranteed NPV by searching over the set of all feasible expansion scenarios, and show that this can be solved by an exact cutting plane approach. We also propose a heuristic based on a constant proportion distribution rule for the WtE expansion optimization model, which reduces the problem into a moderate size mixed‐integer program. Finally, our computational studies demonstrate that our proposed expansion model solutions are very stable and competitive in performance compared to scenario tree approaches. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 47–70, 2016     

Generalizing the survival signature to unrepairable homogeneous multi‐state systems

The notion of signature has been widely applied for the reliability evaluation of technical systems that consist of binary components. Multi‐state system modeling is also widely used for representing real life engineering systems whose components can have different performance levels. In this article, the concept of survival signature is generalized to a certain class of unrepairable homogeneous multi‐state systems with multi‐state components. With such a generalization, a representation for the survival function of the time spent by a system in a specific state or above is obtained. The findings of the article are illustrated for multi‐state consecutive‐k‐out‐of‐n system which perform its task at three different performance levels. The generalization of the concept of survival signature to a multi‐state system with multiple types of components is also presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 593–599, 2017     

一种基于二分法的无线传感器网络拓扑控制算法

文中针对传感器节点分布不均和拓扑建立时间长的问题,提出了一种基于二分法的拓扑控制算法,每个节点自适应选择发射功率以获得预设的度。仿真显示,与基于均匀功率增量的算法相比,基于二分法的拓扑控制算法大大减少了功率切换次数且形成的拓扑简单,减少了网络拓扑形成时间和平均发射功率。     

基于遭遇角决策的并行双模切换舵减摇控制

结合舵减摇控制中通用线性模型与模糊线性模型的优缺点,采用了一种根据遭遇角的不同自动切换控制器设计模型的并行双模切换舵减摇控制方案。为在线自动辨识遭遇角,提出基于横摇功率谱密度柱状图的神经网络辨识方法。仿真结果表明,该方法辨识精度较高,且比传统重心法节省了在线计算量与存储数据库所需的存储空间,简化了辨识流程。