装备再制造性指标分配

再制造性设计是装备再制造工程的重要组成部分,是实现退役装备易于再制造的可靠保证,而再制造性指标分配是再制造性设计的重要内容,它能够保证所要求的指标科学地分配到装备各零部件,实现装备再制造效益的最大化。探讨了再制造性指标分配的相关概念及其再制造性指标分配程序,并提出了几种可行的再制造性指标分配方法,为装备的再制造性设计提供了有效的技术支撑。     

Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach

In this paper, we develop an iterative piecewise linear approximation approach with a novel initialization method to solve natural gas pipeline transmission problems with the nonuniform network elevation. Previous approaches, such as energy minimization methods, cannot be applied to solve problems with the nonuniform network elevation because they exclude pressure range constraints, and thus provide solutions far from optimum. We propose a new initialization model that considers pressure range constraints and improves the optimality of the solutions and the computational efficiency. Furthermore, we extend the energy minimization methods and provide the necessary conditions under which the extended methods operate in networks with the nonuniform elevation. We test the performances of the methods with previously reported pipeline networks from the literature, with the open data set GasLib, and with our industrial collaborator. The initialization approach is shown to be more efficient than the method with fixed initial breakpoints. The newly proposed initialization approach generates solutions with a higher accuracy than the extended energy minimization methods, especially in large‐size networks. The proposed method has been applied to natural gas transmission planning by the China National Petroleum Corporation and has brought a direct profit increase of 330 million U.S. dollars in 2015‐2017.     

制备工艺对弧焊成形件性能影响研究进展

阐述了弧焊工艺参数、搭接量、层间冷却时间、焊接路径规划以及激光-弧焊复合焊接工艺对成形件组织性能(残余应力、温度场、组织、硬度、抗拉强度)影响的研究现状,总结了尺寸与性能控制一体化快速制造、尺寸控制和表面改性复合快速制造、基于机械加工特征的性能控制等研究新进展,最后指出未来性能控制研究应在性能控制建模、几何尺寸与表面性能控制的顶层设计、弧焊快速制造与纳米表面工程的复合运用等方面加以重视。     

一种雷达波衰减型红外迷彩伪装遮障材料设计方案

伪装遮障以其伪装性能好、适应能力强、作业简单、携带方便而在现代战争中被广泛采用。在对遮障材料性能要求分析的基础上,提出了一种新型雷达波衰减型红外迷彩伪装遮障材料的设计方案。其在可见光、近红外、雷达波段均具有良好的反探测性能,可有效对抗现代高技术侦察手段和设施。     

Free riding in a multi‐channel supply chain

Free riding in a multichannel supply chain occurs when one retail channel engages in the customer service activities necessary to sell a product, while another channel benefits from those activities by making the final sale. Although free riding is, in general, considered to have a negative impact on supply chain performance, certain recent industry practices suggest an opposite view: a manufacturer may purposely induce free riding by setting up a high‐cost, customer service‐oriented direct store to allow consumers to experience the product, anticipating their purchase at a retail store. This article examines how the free riding phenomenon affects a manufacturer's supply chain structure decision when there are fixed plus incremental variable costs for operating the direct store. We consider factors such as the effort required to find and buy the product at a retail store after visiting the direct store, the existence of competing products in the market, and the extent of consumer need to obtain direct‐store service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

A two‐echelon inventory‐location problem with service considerations

We study the problem of designing a two‐echelon spare parts inventory system consisting of a central plant and a number of service centers each serving a set of customers with stochastic demand. Processing and storage capacities at both levels of facilities are limited. The manufacturing process is modeled as a queuing system at the plant. The goal is to optimize the base‐stock levels at both echelons, the location of service centers, and the allocation of customers to centers simultaneously, subject to service constraints. A mixed integer nonlinear programming model (MINLP) is formulated to minimize the total expected cost of the system. The problem is NP‐hard and a Lagrangian heuristic is proposed. We present computational results and discuss the trade‐off between cost and service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

装备设计中的再制造性指标预计方法

再制造性设计是装备再制造工程的重要组成部分,是实现退役装备易于再制造的可靠保证,再制造性指标预计是再制造性设计的重要内容。探讨了再制造性指标预计的相关概念及其再制造性指标预计程序,并综合提出了几种可行的再制造性指标预计方法,可为装备的再制造性设计提供技术支撑。     

基于纯纠缠态的量子安全直接通信协议

基于纯纠缠态,提出一种量子安全直接通信协议.通信方利用decoy光子来检测窃听.在保证量子信道的安全后,发送方通过控制非操作和von Neumarm测量将秘密消息编码在纯纠缠态上并发送给接收方.由于所有的纯纠缠态都用于传输秘密消息,该协议具有较高的量子比特效率.就实验的可行性来说,该协议可以用当前的技术实现.此外,该协议在噪声量子信道中也是安全的.