Contracts and coordination: Supply chains with uncertain demand and supply

Considering a supply chain with a supplier subject to yield uncertainty selling to a retailer facing stochastic demand, we find that commonly studied classical coordination contracts fail to coordinate both the supplier's production and the retailer's procurement decisions and achieve efficient performance. First, we study the vendor managed inventory (VMI) partnership. We find that a consignment VMI partnership coupled with a production cost subsidy achieves perfect coordination and a win‐win outcome; it is simple to implement and arbitrarily allocates total channel profit. The production cost subsidy optimally chosen through Nash bargaining analysis depends on the bargaining power of the supplier and the retailer. Further, motivated by the practice that sometimes the retailer and the supplier can arrange a “late order,” we also analyze the behavior of an advance‐purchase discount (APD) contract. We find that an APD with a revenue sharing contract can efficiently coordinate the supply chain as well as achieve flexible profit allocation. Finally, we explore which coordination contract works better for the supplier vs. the retailer. It is interesting to observe that Nash bargaining solutions for the two coordination contracts are equivalent. We further provide recommendations on the applications of these contracts. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 305–319, 2016     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

基于状态变换的数字电路冗余确认研究

以状态跳变图为基础,深入分析了冗余变换与非法变换的特征,提出结构冗余和功能冗余的概念,并讨论了可测故障、不可测故障和冗余之间的联系.最后结合验证和测试生成,提出状态冗余的隐含遍历确认策略.     

舰船装备随行备件量需求规律分析

通过对舰船装备备件需求影响因素的分析 ,从理论上推导了备件需求的分布规律 ,在此基础上建立了舰船级备件典型需求模型 ,并且对典型的故障分布模型进行了推广     

Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

Applying a bootstrap approach for setting reorder points in military supply systems

This paper develops and applies a nonparametric bootstrap methodology for setting inventory reorder points and a simple inequality for identifying existing reorder points that are unreasonably high. We demonstrate that an empirically based bootstrap method is both feasible and calculable for large inventories by applying it to the 1st Marine Expeditionary Force General Account, an inventory consisting of $20–30 million of stock for 10–20,000 different types of items. Further, we show that the bootstrap methodology works significantly better than the existing methodology based on mean days of supply. In fact, we demonstrate performance equivalent to the existing system with a reduced inventory at one‐half to one‐third the cost; conversely, we demonstrate significant improvement in fill rates and other inventory performance measures for an inventory of the same cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 459–478, 2000     

An optimal recursive method for various inventory replenishment models with increasing demand and shortages

We establish various inventory replenishment policies to solve the problem of determining the timing and number of replenishments. We then analytically compare various models, and identify the best alternative among them based on minimizing total relevant costs. Furthermore, we propose a simple and computationally efficient optimal method in a recursive fashion, and provide two examples for illustration. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 791–806, 1997     

A continuous‐time strategic capacity planning model

Capacity planning decisions affect a significant portion of future revenue. In the semiconductor industry, they need to be made in the presence of both highly volatile demand and long capacity installation lead‐times. In contrast to traditional discrete‐time models, we present a continuous‐time stochastic programming model for multiple resource types and product families. We show how this approach can solve capacity planning problems of reasonable size and complexity with provable efficiency. This is achieved by an application of the divide‐and‐conquer algorithm, convexity, submodularity, and the open‐pit mining problem. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

坦克动力舱空气流动计算区域的网格生成

为了合理解决网格划分对坦克动力舱空气流动与传热三维数值计算效率和计算精度的影响,特提出动力舱空气流动计算区域的网格生成方法.对某型坦克动力舱的网格生成实例,显示了这种方法的实用性.     

星空点源背景红外辐射场景生成模型

星空场景建模是空间目标识别与跟踪的关键技术之一.基于中段空间实验红外天文星表(MSX-IRAC),通过位置计算得到该星表内恒星在指定观测时刻、观测地点投影到视场所在平面的坐标,同时利用改进的光谱模板技术,生成视场内所有点源星体的红外光谱(1.2～35 μm),并对光谱积分得到指定谱段的辐射量,最后将恒星位置和辐射信息在二维图像上表现出来,从而实现了一个星空点源背景红外辐射场景生成模型,并通过实例仿真验证了该模型的正确性.