直觉层次模糊评价法的航材逆向物流效益评估

在分析影响航材逆向物流效益因素的基础上,构建了航材逆向物流效益指标体系,提出了一种新的效益评估方法,这种方法将直觉模糊熵权法与层次分析法有效地结合起来,共同确定指标权重,再通过模糊综合评价法对航材逆向物流效益进行评估,提高了评估的科学性和准确性,为航材部门完善物流环节、提高物流效益提供了一定的参考。     

属性约简方法在威胁因素选择中的应用

分析了影响对空威胁判断的威胁因素,确定了各属性值离散化的处理标准,构建了基于粗糙集理论的对空威胁判断决策信息表;通过基于属性重要性的约简方法和基于正区域的约简方法对威胁因素进行了约简,确定了水面舰艇对空威胁判断的威胁因素,最后用Matlab仿真技术验证结论的正确性。     

含运动副间隙舵机执行机构的动态特性研究

为了研究运动副间隙对空间4R机构动态特性的影响,间隙处的接触碰撞模型和摩擦的建立分别采用非线性弹簧阻尼模型和修正的库伦摩擦模型。在Solidworks中建立空间4R机构模型,导入ADAMS中进行动力学仿真分析。对比含间隙和不含间隙时系统动力学仿真结果的异同,分析间隙大小和最佳间隙量对空间4R机构动态特性的影响,为机构的设计提供了重要的参考依据,有利于工程实际应用。     

Production scheduling with history‐dependent setup times

We consider a parallel‐machine scheduling problem with jobs that require setups. The duration of a setup does not depend only on the job just completed but on a number of preceding jobs. These setup times are referred to as history‐dependent. Such a scheduling problem is often encountered in the food processing industry as well as in other process industries. In our model, we consider two types of setup times—a regular setup time and a major setup time that becomes necessary after several “hard‐to‐clean” jobs have been processed on the same machine. We consider multiple objectives, including facility utilization, flexibility, number of major setups, and tardiness. We solve several special cases assuming predetermined job sequences and propose strongly polynomial time algorithms to determine the optimal timing of the major setups for given job sequences. We also extend our analysis to develop pseudopolynomial time algorithms for cases with additional objectives, including the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Priority queue with customer upgrades

This article is concerned with a general multi‐class multi‐server priority queueing system with customer priority upgrades. The queueing system has various applications in inventory control, call centers operations, and health care management. Through a novel design of Lyapunov functions, and using matrix‐analytic methods, sufficient conditions for the queueing system to be stable or instable are obtained. Bounds on the queue length process are obtained by a sample path method, with the help of an auxiliary queueing system. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Parametric inference for component distributions from lifetimes of systems with dependent components

In system reliability analysis, for an n ‐component system, the estimation of the performance of the components in the system is not straightforward in practice, especially when the components are dependent. Here, by assuming the n components in the system to be identically distributed with a common distribution belonging to a scale‐family and the dependence structure between the components being known, we discuss the estimation of the lifetime distributions of the components in the system based on the lifetimes of systems with the same structure. We develop a general framework for inference on the scale parameter of the component lifetime distribution. Specifically, the method of moments estimator (MME) and the maximum likelihood estimator (MLE) are derived for the scale parameter, and the conditions for the existence of the MLE are also discussed. The asymptotic confidence intervals for the scale parameter are also developed based on the MME and the MLE. General simulation procedures for the system lifetime under this model are described. Finally, some examples of two‐ and three‐component systems are presented to illustrate all the inferential procedures developed here. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

含万向铰偏斜轴系的过渡过程横扭耦合振动特性

为提供船艇推进、火炮、航空动力及传动装置机械设计的理论分析基础,建立了加速度冲击下含万向铰偏斜轴系横扭耦合振动模型,揭示了轴系的过渡过程横扭耦合振动特性。将从动轴视为弯曲刚性、扭转柔性的轴,用投影平面上动态偏斜角表示轴系横向振动,用拉格朗日方程推导了万向铰轴系过渡过程横扭耦合三自由度振动微分方程,结合振动响应仿真给出了加速度和系统参数对轴系过渡过程横扭耦合振动特性的影响规律。结果表明:负载转矩增大和刚度不对称性减小导致耦合振动系统颤振失稳区增大;在超谐共振区内,加速度增大对过渡过程系统振动起稳定作用,转矩、刚度和偏斜角增大导致过渡过程系统振动失稳区域变大。     

舰船成本预测系统中的自变量约简方法

针对舰船成本预测系统中自变量众多且相互关系错综复杂的特点,提出了用模糊粗糙集方法对舰船成本预测系统中的自变量进行约简。在模糊粗糙集方法的框架下,给出了模糊不可分辨关系和相对约简的定义,构建了基于模糊粗糙集的舰船成本预测系统自变量约简模型,并且针对实际的舰船成本预测系统一般是混合数据系统的问题,对广义差别矩阵的定义进行了改进,设计了相应的启发式约简算法。实例分析结果表明:文中所提的方法不仅能使约简的自变量大为减少,而且约简的效果较传统方法更好,且计算过程也更简单。     

Reliability of linear multistate multiple sliding window systems

This paper proposes a new model that generalizes the linear consecutive k‐out‐of‐r‐from‐n:F system to multistate case with multiple failure criteria. In this model (named linear multistate multiple sliding window system) the system consists of n linearly ordered multistate elements (MEs). Each ME can have different states: from complete failure up to perfect functioning. A performance rate is associated with each state. Several functions are defined for a set of integer numbers ρ in such a way that for each r ∈ ρ corresponding function f_r produces negative values if the combination of performance rates of r consecutive MEs corresponds to the unacceptable state of the system. The system fails if at least one of functions f_r for any r consecutive MEs for r ∈ ρ produces a negative value. An algorithm for system reliability evaluation is suggested which is based on an extended universal moment generating function. Examples of system reliability evaluation are presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling and lot streaming in two‐machine open shops with no‐wait in process

We study the problem of minimizing the makespan in no‐wait two‐machine open shops producing multiple products using lot streaming. In no‐wait open shop scheduling, sublot sizes are necessarily consistent; i.e., they remain the same over all machines. This intractable problem requires finding sublot sizes, a product sequence for each machine, and a machine sequence for each product. We develop a dynamic programming algorithm to generate all the dominant schedule profiles for each product that are required to formulate the open shop problem as a generalized traveling salesman problem. This problem is equivalent to a classical traveling salesman problem with a pseudopolynomial number of cities. We develop and test a computationally efficient heuristic for the open shop problem. Our results indicate that solutions can quickly be found for two machine open shops with up to 50 products. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005