Determining a threshold control policy for an imperfect production system with rework jobs

Consider a threshold control policy for an imperfect production system with only a work center handling both regular and rework jobs. An imperfect production system studied here, generates defect jobs by factors other than machine failures. A threshold control or (ω, s) policy sets the guideline for a work center to switch between regular and rework jobs. A production cycle begins with loading and processing of several batches of regular jobs with a lot size equal to s. The outcome of each completed regular job is an independent Bernoulli trial with three possibilities: good, rework, or scrap. Once the work center accumulates more than a threshold ω of rework jobs, it finishes the last batch of regular jobs and switches to rework jobs. The objective of this research is to find a threshold ω and a lot size s that maximize the average long‐term profit. The ultimate goal is to construct a simple algorithm to search for ω and s that can be implemented directly in production management systems, as a result of this work. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 273–301, 1999     

严寒地区消防给水存在的问题及对策

分析了我国北方寒冷地区城市市政消防给水和室外消火栓系统在实际应用中出现的问题,并结合规范与寒冷地区实际情况和历年的经验,提出了解决办法。     

加快实验改革 提高实验教学效果

本文从培养学生自信心、整合实验内容、完善考试方法三个方面论述了加快实验改革,提高实验教学水平的必要性,以及所采取的具体方法。     

Machine scheduling with pickup and delivery

The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Attrition through a partially coordinated area defense

An area defense consists of several groups that act independently, i.e., do not communicate with each other. Each group has a fixed number of defenders and a controller that allocates these defenders optimally against the individual attackers comprising an attack. We analyze the effectiveness of this partially coordinated defense against a simultaneous attack of known size in which all attackers are considered to be equally lethal. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Finding the Kth shortest path in a time‐schedule network

We consider the problem of finding the Kth shortest path for a time‐schedule network, where each node in the network has a list of prespecified departure times, and departure from the node can take place only at one of these departure times. We develop a polynomial time algorithm independent of K for finding the Kth shortest path. The proposed algorithm constructs a map structure at each node in the network, using which we can directly find the Kth shortest path without having to enumerate the first K − 1 paths. Since the same map structure is used for different K values, it is not necessary to reconstruct the table for additional paths. Consequently, the algorithm is suitable for directly finding multiple shortest paths in the same network. Furthermore, the algorithm is modified slightly for enumerating the first K shortest paths and is shown to have the lowest possible time complexity under a condition that holds for most practical networks. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Rayleigh衰落信道下一种实用的Turbo解码算法

通过理论和仿真实验证明:无论Rayleigh衰落信道是否完美估计,Max-Log-MAP算法都与信噪比无关,而且还与其他信道参数无关.通过缩放Max-Log-MAP算法输出软信息的幅度,在没有增加运算量的前提下,解码性能提高到了与Log-MAP算法相当的程度.由于缩放软信息的Max-Log-MAP算法不需要任何信道参数...     

基于多虚拟目标模型的榴弹炮炸偏修正方法

榴弹炮的传统射击修正方法是根据射击目标的高角距变及偏流不变原则完成的,该方法在通常情况下可以满足射击修正精度要求,但是在炮目距离接近最大射程,或因气象条件、弹药条件、火炮条件等数据不准确造成炸点偏离目标较远等情况下,高角距变和偏流均会产生剧烈变化,因此,传统修正方法存在较大误差.提出一种基于多虚拟目标模型的修正方法来改善这个问题,分析结果表明,该方法比传统方法修正精度更高.     

Fullerene bisadduct stabilizers: The effect of different addition positions on inhibiting the autocatalytic decomposition of nitrocellulose absorbed nitroglycerin

To explore the effect of different positions and number of pyrrolidine bound to the carbon cage on the stabilization effect of fulleropyrrolidine derivatives to nitrocellulose (NC)/nitroglycerine (NG), we synthesized N-(4-methoxy) phenylpyrrolidine-C₆₀ and four different of bis(N-(4-methoxy) phenylpyrrolidine)-C₆₀ compounds through Prato reaction. Their structures were characterized by UV–vis, ¹H NMR, ¹³C NMR, high-resolution mass spectroscopy, and single-crystal X-ray diffraction. Their stabilization effect to NC/NG were investigated using differential scanning calorimetry, methyl violet, vacuum stabilization effect, weight loss, and accelerating rate calorimeter tests. The results indicated these compounds had excellent stabilization effect to NC/NG. The stabilization effect of the fulleropyrrolidine bisadducts to NC/NG is significantly better than that of fulleropyrrolidine monoadduct and C₆₀. Moreover, the position where pyrrolidine binds to fullerene in fulleropyrrolidine bisadducts is different, and its stabilization effect to NC is also different. The stabilization effect order of different bisadduct isomers to nitrocellulose is as follows: e-edge > trans-2> cis-2> trans-3. Electron paramagnetic resonance (EPR) and FT-IR were used to study the stabilization mechanism of fulleropyrrolidine derivatives to NC/NG. The EPR results also show that fulleropyrrolidine bisadducts with different addition sites have different abilities to absorb nitroxide, and their ability is better than that of the monoadduct and C₆₀, which is consistent with the results of stabilization effect performance test.