Irreducibility of joint inventory positions in an assemble‐to‐order system under (r,nQ) policies

In a typical assemble‐to‐order system, a customer order may request multiple items, and the order may not be filled if any of the requested items are out of stock. A key customer service measure when unfilled orders are backordered is the order‐based backorder level. To evaluate this crucial performance measure, a fundamental question is whether the stationary joint inventory positions follow an independent and uniform distribution. In this context, this is equivalent to the irreducibility of the Markov chain formed by the joint inventory positions. This article presents a necessary and sufficient condition for the irreducibility of such a Markov chain through a set of simultaneous Diophantine equations. This result also leads to sufficient conditions that are more general than those in the published reports. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Future supply uncertainty in EOQ models

This article deals with an inventory problem where the supply is available only during an interval of (random) length X. The unavailability of supply lasts for a random duration Y. Using concepts from renewal theory, we construct an objective function (average cost/time) in terms of the order-quantity decision variable Q. We develop the individual cost components as order, holding, and shortage costs after introducing two important random variables. Due to the complexity of the objective function when X and Y are general random variables, we discuss two special cases and provide numerical examples with sensitivity analysis on the cost and noncost parameters. The article concludes with a discussion of the comparison of the current model with random yield and random lead-time models. Suggestions for further research are also provided.     

A cover based competitive facility location model with continuous demand

In this paper we propose and solve a competitive facility location model when demand is continuously distributed in an area and each facility attracts customers within a given distance. This distance is a measure of the facility's attractiveness level which may be different for different facilities. The market share captured by each facility is calculated by two numerical integration methods. These approaches can be used for evaluating functional values in other operations research models as well. The single facility location problem is optimally solved by the big triangle small triangle global optimization algorithm and the multiple facility problem is heuristically solved by the Nelder‐Mead algorithm. Extensive computational experiments demonstrate the effectiveness of the solution approaches.     

Analysis of project scheduling strategies in a client-contractor environment

In this article we consider a cost-minimization model to investigate scheduling strategies for multistaged projects in a client-contractor environment. This type of environment is symptomatic of temporal changes in project definition and scope. At prespecified epochs the client conducts an external evaluation of the project and either accepts or rejects the contractor's current work. The resulting uncertainty from the client's review is modeled via monotonically varying acceptance probabilities. The model is designed primarily to address the interaction between earliest-, intermediate-, and latest-start options and project-crashing stragies for a broad range of penalty costs. Theoretical results are introduced, while numerical examples for both exponentially and polynomially based acceptance probabilities are discussed.     

Finite-production-rate inventory models with first-and second-shift setups

This article considers the production planning problem of a shop which can produce in either one shift or two shifts. Setup cost is charged whenever there is an increase in the production rate from one period to the next. Efficient planning horizon procedures have been developed for this model. A numerical example has been included to illustrate the planning horizon results.     

Verification and validation of detonation modeling

The mathematical model used to describe the detonation multi-physics phenomenon is usually given by highly coupled nonlinear partial differential equations. Numerical simulation and the computer aided engineering (CAE) technique has become the third pillar of detonation research, along with theory and experiment, due to the detonation phenomenon is difficult to explain by the theoretical analysis, and the cost required to accredit the reliability of detonation products is very high, even some physical experiments of detonation are impossible. The numerical simulation technique can solve these complex problems in the real situation repeatedly and reduce the design cost and time stunningly. But the reliability of numerical simulation software and the serviceability of the computational result seriously hinders the extension, application and the self-restoration of the simulation software, restricts its independently innovational ability. This article deals with the physical modeling, numerical simulation, and software development of detonation in a unified way. Verification and validation and uncertainty quantification (V&V&UQ) is an important approach in ensuring the credibility of the modeling and simulation of detonation. V&V of detonation is based on our independently developed detonation multi-physics software-LAD2D. We propose the verification method based on mathematical theory and program function as well as availability of its program execution. Validation is executed by comparing with the experiment data. At last, we propose the future prospect of numerical simulation software and the CAE technique, and we also pay attention to the research direction of V&V&UQ.     

A branch‐and‐bound‐based solution approach for dynamic rerouting of airborne platforms

This article is a sequel to a recent article that appeared in this journal, “An extensible modeling framework for dynamic reassignment and rerouting in cooperative airborne operations” [ 17 ], in which an integer programming formulation to the problem of rescheduling in‐flight assets due to changes in battlespace conditions was presented. The purpose of this article is to present an improved branch‐and‐bound procedure to solve the dynamic resource management problem in a timely fashion, as in‐flight assets must be quickly re‐tasked to respond to the changing environment. To facilitate the rapid generation of attractive updated mission plans, this procedure uses a technique for reducing the solution space, supports branching on multiple decision variables simultaneously, incorporates additional valid cuts to strengthen the minimal network constraints of the original mathematical model, and includes improved objective function bounds. An extensive numerical analysis indicates that the proposed approach significantly outperforms traditional branch‐and‐bound methodologies and is capable of providing improved feasible solutions in a limited time. Although inspired by the dynamic resource management problem in particular, this approach promises to be an effective tool for solving other general types of vehicle routing problems. © 2013 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Variance of the number of units produced on a transfer line with buffer inventories during a period of length T

The transfer-line models in the literature are planning models rather than operational models. That is, they are very useful for planning or designing the transfer line, but are less useful for controlling the daily operation of the line. The performance measure used in these models is the efficiency of the line A. The expected number of units produced during a period of length T cycles is AT. In this article a procedure is presented for calculating the variance of the number of units produced by the transfer line during a period of length T cycles. These two performance measures can be used to construct an interval estimate for, say, the number of units produced during a shift. This interval estimate is an operational guide for the production manager.     

An integral equation for the second moment function of a geometric process and its numerical solution

In this article, an integral equation satisfied by the second moment function M₂(t) of a geometric process is obtained. The numerical method based on the trapezoidal integration rule proposed by Tang and Lam for the geometric function M(t) is adapted to solve this integral equation. To illustrate the numerical method, the first interarrival time is assumed to be one of four common lifetime distributions, namely, exponential, gamma, Weibull, and lognormal. In addition to this method, a power series expansion is derived using the integral equation for the second moment function M₂(t), when the first interarrival time has an exponential distribution.     

FLUENT用于大气污染扩散的数值模拟

从模型建立、网格生成、基本方程及附加模型几个方面叙述了FLUENT求解大气污染扩散问题的步骤。在此基础上对模拟计算中初始边界条件的设定、收敛性与稳定性、模型后处理等问题作出分析,并以FLUENT对典型工业园区大气污染扩散过程的数值模拟为例证明了FLUENT解决大气污染扩散问题的适用性,为解决此类问题提供参考。     

论警卫学学科建设

警卫工作是公安工作的重要组成部分,警卫学是公安学的分支学科,加强警卫学学科建设,对于推动公安警卫事业和公安现役院校建设与发展均具有十分重要的理论和现实意义。探讨警卫学研究领域和研究方向、警卫学理论体系和学科体系的构建、警卫学学科建设的思路和措施等问题。     

Poland's national potential and its international position within the European Union – research remarks

This article examines Poland's national potential and its international position within the European Union (EU) with respect to security issues. It presents research results based on a comparison of Poland's national potential as it relates to other EU countries, which is useful when evaluating Poland's power within the EU. The article also evaluates Poland's crisis potential, i.e. it identifies those factors that may potentially be treated as threats to national and regional security. Finally, it enables the identification of challenges to Poland's security in the second decade of the twenty-first century. The research is conducted according to a multidimensional comparative analysis, which is perceived by the author as the best available to measure a country's power despite its weaknesses.     

Optimal motion planning in rapid‐fire combat situations with attacker uncertainty

This article provides a modeling framework for quantifying cost and optimizing motion plans in combat situations with rapid weapon fire, multiple agents, and attacker uncertainty characterized by uncertain parameters. Recent developments in numerical optimal control enable the efficient computation of numerical solutions for optimization problems with multiple agents, nonlinear dynamics, and a broad class of objectives. This facilitates the application of more realistic, equipment‐based combat models, which track both more realistic models, which track both agent motion and dynamic equipment capabilities. We present such a framework, along with a described algorithm for finding numerical solutions, and a numerical example.     

A lost sales (S — 1, S) perishable inventory system with renewal demand

This article analyzes a one-to-one ordering perishable inventory model with renewal demands and exponential lifetimes. The leadtimes are independently and exponentially distributed and the demands that occur during stock out periods are lost. Although the items are assumed to decay at a constant rate, the output process is not renewal and the Markov renewal techniques are successfully employed to obtain the operating characteristics. The problem of minimizing the long run expected cost rate is discussed and numerical values of optimal stock level are also provided. © 1996 John Wiley & Sons, Inc.     

浅谈现代警营饮食文化建设的五要素

建设现代警营饮食文化,是武警部队给养保障建设发展的战略性举措,也是今后一个时期部队饮食保障工作的发展方向。紧密联系武警部队实际,从“转变保障理念,把准建设方向;紧贴保障需求,铸牢物质基础;突出文化渗透,凝聚丰富内涵;强化科学管理,规范良好秩序;建强炊事队伍,提供人才基础”五个方面,对建设现代警营饮食文化进行了探索分析。     

Obligation to prevent (O2P): Proposal for enhanced community approach to genocide prevention in Africa

As empathetic as distant nations may feel about an ongoing or looming catastrophe in a particular region of Africa, they are too far removed from the horror to grasp its gravity and impact. Geographical proximity to the atrocity, and the likelihood of its spreading to their neighbourhoods, make the communities and neighbouring countries in the imploding region the best and most effective first responders to a crisis in their own backyard. A response from ‘communal’ or ‘regional’ groups is, therefore, the most practical measure for preventing human rights violations in Africa from descending into an actual genocide or an intractable genocidal condition. A community approach to preventing genocide and other human rights abuses should serve as the foundation for a new concept of ‘moral pan-Africanism’ on the African continent in the 21^st century. This article makes an argument for this genocide prevention model and new moral concept.     

MANAGING BIORISKS:

The misuse of biological research is increasingly becoming a prominent policy concern. One regulatory measure that has gained considerable support over the last few years in response to this is voluntary self-governance by the scientific community, and in particular codes of conduct. This article charts the rise of the policy debate on codes, highlighting the involvement of the scientific community. Shifting the focus from policy to practice, it explores the effectiveness of codes of conduct as a regulatory measure by examining our experiences of how another voluntary self-governance regime in the biosciences has worked in practice. Noting limitations with voluntary self-governance as a regulatory tool to prevent misuse, this article includes a reflection on the attention paid to codes of conduct in policy discussions, arguing that there are at least three possible interpretations.     

常微分方程的不动点迭代格式

在常微分方程的数值解法中,Euler的隐式格式稳定性较好,但由于它为隐式,因而给计算带来了极大地不方便。为了解决此问题,本文给出了一种数值解法———常微分方程的不动点迭代格式。     

The dynamic and stochastic knapsack Problem with homogeneous‐sized items and postponement options

This article generalizes the dynamic and stochastic knapsack problem by allowing the decision‐maker to postpone the accept/reject decision for an item and maintain a queue of waiting items to be considered later. Postponed decisions are penalized with delay costs, while idle capacity incurs a holding cost. This generalization addresses applications where requests of scarce resources can be delayed, for example, dispatching in logistics and allocation of funding to investments. We model the problem as a Markov decision process and analyze it through dynamic programming. We show that the optimal policy with homogeneous‐sized items possesses a bithreshold structure, despite the high dimensionality of the decision space. Finally, the value (or price) of postponement is illustrated through numerical examples. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 267–292, 2015     

Periodic inspection policy with preventive maintenance

This article considers a modified inspection policy with periodic check intervals, where the unit after check has the same age as before with probability p and is as good as new with probability q. The mean time to failure and the expected number of checks before failure are derived, forming renewal-type equations. The total expected cost and the expected cost per unit of time until detection of failure are obtained. Optimum inspection policies which minimize the expected costs are given as a numerical example.