A comparative study of three tool replacement/operation sequencing strategies in a flexible manufacturing system

This paper studies three tool replacement/operation sequencing strategies for a flexible manufacturing system over a finite time horizon: (1) failure replacement—replace the tool only upon failure, (2) optimal preventive tool replacement for a fixed sequence of operations, and (3) joint scheduling of the optimal preventive tool replacement times and the optimal sequence of operations. Stochastic dynamic decision models are used for strategies 2 and 3. The optimization criterion for strategies 2 and 3 is the minimization of the total expected cost over the finite time horizon. We will show through numerical studies that, with the same amount of information, the total expected costs can be reduced considerably by choosing an optimal strategy. Our conclusion is that in flexible manufacturing, optimal tool replacement and optimal operations sequencing are not separate issues. They should be considered jointly to minimize the expected total cost. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 479–499, 2000     

陀螺马达驱动信号的数字化测量与失真度分析

简要介绍陀螺马达驱动信号的数字化测量方法及失真度分析的数学原理 ,给出了一个实例 .实践证明 ,该方法电路结构简单、参数测量准确、程序编写方便 ,具有较好的实时性能 .     

统编版初中语文名著导读的教学现状及策略探究

名著导读是语文教材中的一个重要板块,是中学师生不得不面对的教学环节,在名著导读教学实践中,教师如何引导、学生怎样阅读的问题一直备受研究者关注,关于名著导读教学的研究著作颇丰。笔者通过问卷调查法,对S市某中学的名著导读教学现状进行分析,进一步探讨名著导读教学中存在的问题,并在此基础上对名著导读教学提出相应的策略。进而使教师导之有效,学生读而有得,使名著导读教学不仅引起师生的重视,更能在教学中得到落实。     

Cyclic best first search: Using contours to guide branch‐and‐bound algorithms

The cyclic best‐first search (CBFS) strategy is a recent search strategy that has been successfully applied to branch‐and‐bound algorithms in a number of different settings. CBFS is a modification of best‐first search (BFS) that places search tree subproblems into contours which are collections of subproblems grouped in some way, and repeatedly cycles through all non‐empty contours, selecting one subproblem to explore from each. In this article, the theoretical properties of CBFS are analyzed for the first time. CBFS is proved to be a generalization of all other search strategies by using a contour definition that explores the same sequence of subproblems as any other search strategy. Further, a bound is proved between the number of subproblems explored by BFS and the number of children generated by CBFS, given a fixed branching strategy and set of pruning rules. Finally, a discussion of heuristic contour‐labeling functions is provided, and proof‐of‐concept computational results for mixed‐integer programming problems from the MIPLIB 2010 database are shown. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 64–82, 2017     

Exact algorithms and bounds for the dynamic assignment interdiction problem

We study a multi‐stage dynamic assignment interdiction (DAI) game in which two agents, a user and an attacker, compete in the underlying bipartite assignment graph. The user wishes to assign a set of tasks at the minimum cost, and the attacker seeks to interdict a subset of arcs to maximize the user's objective. The user assigns exactly one task per stage, and the assignment costs and interdiction impacts vary across stages. Before any stage commences in the game, the attacker can interdict arcs subject to a cardinality constraint. An interdicted arc can still be used by the user, but at an increased assignment cost. The goal is to find an optimal sequence of assignments, coupled with the attacker's optimal interdiction strategy. We prove that this problem is strongly NP‐hard, even when the attacker can interdict only one arc. We propose an exact exponential‐state dynamic‐programming algorithm for this problem as well as lower and upper bounds on the optimal objective function value. Our bounds are based on classical interdiction and robust optimization models, and on variations of the DAI game. We examine the efficiency of our algorithms and the quality of our bounds on a set of randomly generated instances. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 373–387, 2017     

空地支援多目标模型

本文研究空地支援优化问题。模型的构造是基于目标规划理论。首先建立基础模型,然后根据问题条件,建立多目标模型。     

战场弹药贮供建模分析

本文运用库存论、目标规划和计算机模拟等理论与方法,分析研究了战场弹药的储备与补充问题,建立了“两级”弹药贮供数学模型,并应用实战数据在计算机上进行了模拟运算和分析。     

红外导弹制导系统检测的仿真研究

介绍了用简化红外导弹运动学和动力学模型的方法,对导弹的方位和俯仰二个制导系统作单独的仿真检测,介绍了仿真系统的原理及所需设备。可以从计算机屏幕上作图,以判断检测结果。     

增加射击密度,提高航次利用效率

本文根据统计学原理,提出了在每个航路上增加射击密度的设想,以达到既降低试验成本又保证试验结果的可靠性。文中对实现这种设想的可能性作了理论上的证明。这一设想突破了苏联靶场试验法的旧框框,可以使高炮综合体系统射击试验节省有效航次五分之四到三分之二,其效益是十分明显的。     

救灾物资的紧急调运模型

针对某地区防洪救灾中物资的调运问题,利用图论中最短路的知识,根据问题实际,将物资的调运方案分成3个阶段.在每个阶段以费用最小或时间最短为目标.以各单位之间物资的供求平衡为约束,建立了规划模型.通过编程求解,制定了不同情况下物资紧急调运的具体方案,包括用车数量、行车线路、用车时间和费用.