A single‐period inventory placement problem for a serial supply chain

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001     

消防设备的费用估算

通过对防火设备、灭火装备的费用估算,介绍如何利用数学建模的方式进行消防设备费用估算的具体方法,并对火灾过程中装备费用的精确估算方法进行了初步探讨.     

用于动平衡测试的MDAC窄带跟踪滤波器

为了从强干扰噪声中提取出与转速同频的振动分量,且适应转速波动时的情形,利用互相关原理导出了跟踪滤波方法,并采用乘法数模转换器(MDAC)设计并实现了窄带跟踪滤波器。实验结果表明,其增益相对误差优于0.2%,相位绝对误差优于0.4°,当转速变化率不超过9000r/min2时,滤波器的输出能够跟踪转速的变化。该滤波器能较好地满足动平衡测试的需要。     

基于Linux虚拟服务器的负载均衡技术探讨

Internet业务量的激增和网络应用特殊化都使得负载均衡成为迫切需求。如何实现网络服务器负载均衡是一个急待解决的新课题。而LVS是一个具有良好的扩展性、高可靠性、高性能、高可用性的基于Linux系统的服务器集群,利用它可以较好解决这一问题。针对Linux虚拟服务器集群的负载均衡技术,探讨了其体系结构、工作方式、负载均衡算法,并以一简单的应用实例介绍了其具体实现。这样可以在很大程度上减轻网络的负载,提高网络的效率,是未来网络服务器技术的主要发展方向之一。     

The Persistent Deficit of Militia Officers in the Swiss Armed Forces: An Opportunity Cost Explanation

The Swiss Armed Forces are suffering from a structural deficit of militia officers despite good pay and a general supportive attitude in the population. Whereas, prior studies have focused on motivation to explain understaffing in armed forces, we offer an alternative approach based on opportunity cost. We model decision alternatives both within and outside a military organization, taking private sector employment as the reference point. We then monetize opportunity costs of leisure, fringe benefits, and private sector income not compensated. Our results suggest that in terms of opportunity cost, service as a militia officer is the least attractive option, an effect that we believe explains the persistent staff deficit. Implications of these findings for the literature and recruitment policy are discussed.     

Timely exposure of a secret project: Which activities to monitor?

A defender wants to detect as quickly as possible whether some attacker is secretly conducting a project that could harm the defender. Security services, for example, need to expose a terrorist plot in time to prevent it. The attacker, in turn, schedules his activities so as to remain undiscovered as long as possible. One pressing question for the defender is: which of the project's activities to focus intelligence efforts on? We model the situation as a zero‐sum game, establish that a late‐start schedule defines a dominant attacker strategy, and describe a dynamic program that yields a Nash equilibrium for the zero‐sum game. Through an innovative use of cooperative game theory, we measure the harm reduction thanks to each activity's intelligence effort, obtain insight into what makes intelligence effort more effective, and show how to identify opportunities for further harm reduction. We use a detailed example of a nuclear weapons development project to demonstrate how a careful trade‐off between time and ease of detection can reduce the harm significantly.     

An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines

We consider the multitasking scheduling problem on unrelated parallel machines to minimize the total weighted completion time. In this problem, each machine processes a set of jobs, while the processing of a selected job on a machine may be interrupted by other available jobs scheduled on the same machine but unfinished. To solve this problem, we propose an exact branch‐and‐price algorithm, where the master problem at each search node is solved by a novel column generation scheme, called in‐out column generation, to maintain the stability of the dual variables. We use a greedy heuristic to obtain a set of initial columns to start the in‐out column generation, and a hybrid strategy combining a genetic algorithm and an exact dynamic programming algorithm to solve the pricing subproblems approximately and exactly, respectively. Using randomly generated data, we conduct numerical studies to evaluate the performance of the proposed solution approach. We also examine the effects of multitasking on the scheduling outcomes, with which the decision maker can justify making investments to adopt or avoid multitasking.     

Shortest path interdiction problem with arc improvement recourse: A multiobjective approach

We consider the shortest path interdiction problem involving two agents, a leader and a follower, playing a Stackelberg game. The leader seeks to maximize the follower's minimum costs by interdicting certain arcs, thus increasing the travel time of those arcs. The follower may improve the network after the interdiction by lowering the costs of some arcs, subject to a cardinality budget restriction on arc improvements. The leader and the follower are both aware of all problem data, with the exception that the leader is unaware of the follower's improvement budget. The effectiveness of an interdiction action is given by the length of a shortest path after arc costs are adjusted by both the interdiction and improvement. We propose a multiobjective optimization model for this problem, with each objective corresponding to a different possible improvement budget value. We provide mathematical optimization techniques to generate a complete set of strategies that are Pareto‐optimal. Additionally, for the special case of series‐parallel graphs, we provide a dynamic‐programming algorithm for generating all Pareto‐optimal solutions.     

装备维修器材生产路径决策的两阶启发式算法

当前装备供应保障系统中维修器材存在短缺、积压以及配送系统效率低下等问题,亟须对生产、库存和配送作业环节进行集成优化。为客观反映各个决策环节,将该问题公式化为一个混合整数线性规划模型,针对该模型多变量、多约束的特点,提出了一个基于数学规划的两阶启发式算法对其进行求解。结合算例,检验模型的可行性,并选取求解器CPLEX和一个类似的迭代算法与该算法在求解质量和运算时间方面进行对比与分析。结果表明,提出的模型是合理可行的,该算法在求解不同规模实例时表现出优异的性能。     

Addressing the “headwinds” faced by the European arms industry

ABSTRACT

The European arms industry is challenged by several adverse “headwinds.” Fragmentation leads to costly duplications and, in conjunction with stagnating budgets and sharply increasing costs, prevents firms from exploiting economies of scale and learning. This is exacerbated by size differentials vis-a-vis the leading US arms manufacturers and competition from emerging producers. As some “headwinds” are self-enforcing, far-reaching industrial and policy responses are required to improve the industry's outlook. As exports may not indefinitely compensate for low domestic demand, there is an economic imperative for further cross-border collaboration and consolidation. Despite various EU policy initiatives, progresses regarding the European Defence Equipment Market and strengthening the European Defence Technological Industrial Base have been relatively slow. It remains to be seen whether the European Defence Fund will be the proclaimed “game-changer,” raising competitiveness of the European arms industry. At the same time, the UK's withdrawal from the EU adds uncertainties.