Inducing coordination in supply chains through linear reward schemes

Decentralized decision‐making in supply chain management is quite common, and often inevitable, due to the magnitude of the chain, its geographical dispersion, and the number of agents that play a role in it. But, decentralized decision‐making is known to result in inefficient Nash equilibrium outcomes, and optimal outcomes that maximize the sum of the utilities of all agents need not be Nash equilibria. In this paper we demonstrate through several examples of supply chain models how linear reward/penalty schemes can be implemented so that a given optimal solution becomes a Nash equilibrium. The examples represent both vertical and horizontal coordination issues. The techniques we employ build on a general framework for the use of linear reward/penalty schemes to induce stability in given optimal solutions and should be useful to other multi‐agent operations management settings. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于供应链管理的战时装备供应保障业务流程重组

从战时装备供应链管理的要素和相互关系出发,结合我军实际,提出了基于供应链的战时装备供应保障业务流程重组过程,并对相关方法进行了讨论,旨在使战时所需装备以可预见的方式快速、安全、准确地送抵到作战部队。     

基于马尔柯夫决策过程动态WTA最优化模型分析

在作战过程中,通过把目标群的威胁程度作为目标函数制定决策,可将目标分配决策过程变成马尔柯夫决策过程.即首先对攻防作战态势进行抽象性描述,建立基于马尔柯夫决策过程动态WTA最优化模型,然后提出了有限次迭代求解最优策略的新方法,并进行了算例验证和分析.结果表明该方法可使武器系统获得最大的射击效率,并能有效地减少重点目标突防的概率.     

Dynamic policy for idling time preservation

This study aims to determine and evaluate dynamic idling policies where an agent can idle while some customers remain waiting. This type of policies can be employed in situations where the flow of urgent customers does not allow the agent to spend sufficient time on back-office tasks. We model the system as a single-agent exponential queue with abandonment. The objective is to minimize the system's congestion while ensuring a certain proportion of idling time for the agent. Using a Markov decision process approach, we prove that the optimal policy is a threshold policy according to which the agent should idle above (below) a certain threshold on the queue length if the congestion-related performance measure is concave (convex) with respect to the number of customers present. We subsequently obtain the stationary probabilities, performance measures, and idling time duration, expressed using complex integrals. We show how these integrals can be numerically computed and provide simpler expressions for fast-agent and heavy-traffic asymptotic cases. In practice, the most common way to regulate congestion is to control access to the service by rejecting some customers upon arrival. Our analysis reveals that idling policies allow high levels of idling probability that such rejection policies cannot reach. Furthermore, the greatest benefit of implementing an optimal idling policy occurs when the objective occupation rate is close to 50% in highly congested situations.     

Markovian models of three‐on‐one combat involving a hidden defender

In this paper, Markovian models of three‐on‐one stochastic firefights between ground‐based weapon systems are developed. These models address a common scenario of interest to the military, but one which has been much neglected in analytic combat models, that of combat between a hidden defender and an exposed attacking force. Each combatant must detect an opponent before commencing their firing cycle, a task which is considerably more difficult for the attacker. In the models developed here, the defender detects the exposed attacking group after an exponentially distributed time interval, while each attacker has a fixed probability of detecting the defender via the flash signature produced after each shot fired by him. The utility of the approach is demonstrated by investigating what impact the introduction of a coordinated gun‐laying system for the attacking force might have, a system made possible by battlefield digitization. The method used here allows models to be developed incrementally. This and other advantages of the Markovian approach are discussed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 627–646, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10041     

Analysis of down times of jib cranes—A stochastic approach

In this paper a case study dealing with the maintenance problem of jib cranes is presented. A jib crane is viewed as a complex system whose performance is observed as a single realization over period of time. After pointing out limitations of existing stochastic models to analyze the observed realization a new family of bivariate stochastic processes is introduced. The data of jib crane is analyzed using new model and cross‐validated using part of the data set. It is noted that the new family of stochastic processes is useful to analyze bivariate data where one of the variables is finitely valued and the other is nonnegative and continuous. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 231–243, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10006     

两个单周期的备件存储模型

在工作寿命和修理时间之一服从一般的连续型分布,另一个服从指数分布的情形下讨论了单周期的备件存储问题,通过适当地划分系统的状态,利用Markov更新过程的理论进行了分析,建立了概率型模型,并由模型得到了最佳备件数的求法。     

柴油机磨损寿命的灰色马尔柯夫模型预测

基于灰色系统理论,将灰色ＧＭ（１,１）预测模型和马尔柯夫预测模型的优点结合起来,形成一个灰色马尔柯夫预测模型,拓宽了灰色预测的应用范围。特别地,这种模型的预测结果比其它随机波动性较大的数据到模型的预测结果精确得多。对柴油机磨损寿命进行预测,取得了令人满意的结果。     

炮兵群自动化指挥系统决策组织结构的 Petri 网建模与性能分析

对炮兵自动化指挥系统中决策组织的结构和能力进行了研究,建立了较为完善的各级指挥员指挥决策体系的Ｐｅｔｒｉ网模型。通过有色Ｐｅｔｒｉ网对群一级的炮兵自动化指挥系统在不同任务环境下的不同工作方式进行了建模表示和分析,引入了决策时延这一反应指挥决策体系能力的重要性能指标,并进一步运用马尔科夫链的分析方法对建立的指挥决策体系的Ｐｅｔｒｉ网模型进行定量分析,得出了量化结果,为自动化指挥系统中决策组织结构的设计和分析提供了理论根据。     

快速边缘跟踪与边界链码的获取

本文首先讨论了边缘跟踪的常用方法,并指出了其存在的缺点,而后提出了虚象点与虚链的概念,并讨论了它们的性质。在此基础上,提出了快速边缘跟踪的算法和边界链码的获取。