A generalized assignment model for dynamic supply chain capacity planning

We consider a generalization of the well‐known generalized assignment problem (GAP) over discrete time periods encompassed within a finite planning horizon. The resulting model, MultiGAP, addresses the assignment of tasks to agents within each time period, with the attendant single‐period assignment costs and agent‐capacity constraint requirements, in conjunction with transition costs arising between any two consecutive periods in which a task is reassigned to a different agent. As is the case for its single‐period antecedent, MultiGAP offers a robust tool for modeling a wide range of capacity planning problems occurring within supply chain management. We provide two formulations for MultiGAP and establish that the second (alternative) formulation provides a tighter bound. We define a Lagrangian relaxation‐based heuristic as well as a branch‐and‐bound algorithm for MultiGAP. Computational experience with the heuristic and branch‐and‐bound algorithm on over 2500 test problems is reported. The Lagrangian heuristic consistently generates high‐quality and in many cases near‐optimal solutions. The branch‐and‐bound algorithm is also seen to constitute an effective means for solving to optimality MultiGAP problems of reasonable size. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Bayesian analysis of queues with impatient customers: Applications to call centers

Queuing models have been extensively used in the literature for obtaining performance measures and developing staffing policies. However, most of this work has been from a pure probabilistic point of view and has not addressed issues of statistical inference. In this article, we consider Bayesian queuing models with impatient customers with particular emphasis on call center operations and discuss further extensions. We develop the details of Bayesian inference for queues with abandonment such as the M/M/s + M model (Erlang‐A). In doing so, we discuss the estimation of operating characteristics and its implications on staffing. We illustrate the implementation of the Bayesian models using actual arrival, service, and abandonment data from call centers. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

美军“爱国者”导弹武器系统维修保障研究

美国及其他军事强国都将导弹武器系统维修保障作为每年国防投入的重点内容之一,维修保障也已成为国外军工企业拓展军品产业链、保障企业持续获得收入的重要业务之一。“爱国者”导弹武器系统作为美军防空的主战装备,研究维修保障主要做法能够揭示美军导弹武器系统维修保障状况。从“爱国者”导弹武器系统的两级维修体制、陆军延寿计划两大方面分析其维修保障的主要做法及未来发展趋势,对于持续提升我军导弹武器系统维修保障水平具有重要参考价值。     

对装备可计量性的思考

本文在提出可计量性的定义与对可计量性理解的基础上,梳理了可计量性与装备"五性"的关系,分析了可计量性研究对计量保障的作用,以及可计量性在武器装备全系统全寿命周期中的作用,并对如何开展在研和现役武器装备的可计量性研究提供了思路。     

基于SD模型的弹药消耗规律研究

传统弹药消耗研究主要将重点放在微观层面对具体的弹药需求量的计算方法上,没有科学回答实际作战中弹药消耗的宏观规律和趋势。在上述计算思路的基础上,建立了系统动力学模型,对从总体上对战时双方兵力因素、武器因素以及各个作战阶段弹药消耗的规律作了有益的探索,从宏观上得出了战时弹药消耗的本质规律,对战略、战役指挥员从宏观层面整体把握弹药消耗的本质规律具有重要意义。     

基于最大保障时间的战时装备维修任务调度模型

战时维修机构承担的维修任务比较繁重,合理、科学地安排维修任务可以有效地提高作战部队的战斗力.对此,分析了战时维修任务调度的特点,建立了基于最大保障时间的维修任务静态、动态调度模型,并提出了相应的模型求解方法.利用本方法在满足作战单元最大保障时间前提下,可使得装备维修效益最大,并可以实现实时动态维修任务调度,有效地解决了一种战时维修任务调度问题.     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Analysis of supply contracts with commitments and flexibility

In this article we address an important class of supply contracts called the Rolling Horizon Flexibility (RHF) contracts. Under such a contract, at the beginning of the horizon a buyer has to commit requirements for components for each period into the future. Usually, a supplier provides limited flexibility to the buyer to adjust the current order and future commitments in a rolling horizon manner. We present a general model for a buyer's procurement decision under RHF contracts. We propose two heuristics and derive a lower bound. Numerically, we demonstrate the effectiveness of the heuristics for both stationary and non‐stationary demands. We show that the heuristics are easy to compute, and hence, amenable to practical implementation. We also propose two measures for the order process that allow us to (a) evaluate the effectiveness of RHF contracts in restricting the variability in the orders, and (b) measure the accuracy of advance information vis‐a‐vis the actual orders. Numerically we demonstrate that the order process variability decreases significantly as flexibility decreases without a dramatic increase in expected costs. Our numerical studies provide several other managerial insights for the buyer; for example, we provide insights into how much flexibility is sufficient, the value of additional flexibility, the effect of flexibility on customer satisfaction (as measured by fill rate), etc. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Network reliability assessment in a random environment

In this paper we consider networks that consist of components operating under a randomly changing common environment. Our work is motivated by power system networks that are subject to fluctuating weather conditions over time that affect the performance of the network. We develop a general setup for any network that is subject to such environment and present results for network reliability assessment under two repair scenarios. We also present Bayesian analysis of network failure data and illustrate how reliability predictions can be obtained for the network. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 574–591, 2003     

一种新的Gabor小波支持向量机人脸识别算法

提出了一种新的基于Gabor小波特征重组的支持向量机人脸识别方法。该方法首先计算5个尺度和8个方向的Gabor小波变换结果,再把不同人脸中的同一尺度和方向的变换结果进行特征重组,得到40个新特征矩阵,分别利用PCA方法降维去噪,最后构造40个支持向量机分类器并采用选票决策机制决定识别结果。实验结果表明,该方法不仅拓宽了主元分析法中累积方差贡献率可选范围,并在一定程度上解决了核参数选择难的问题,同时取得了理想识别效果。