微波与红外干衣实验研究

本文从干燥机理出发分析了微波干衣优于红外的性能，并且从实验表明微波干衣比用ＰＴＣ陶瓷板红外干衣平均节能１０～３０％，平均节时２０～４０％。     

Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility

In this article we introduce a 2‐machine flowshop with processing flexibility. Two processing modes are available for each task: namely, processing by the designated processor, and processing simultaneously by both processors. The objective studied is makespan minimization. This production environment is encountered in repetitive manufacturing shops equipped with processors that have the flexibility to execute orders either individually or in coordination. In the latter case, the product designer exploits processing synergies between two processors so as to execute a particular task much faster than a dedicated processor. This type of flowshop environment is also encountered in labor‐intensive assembly lines where products moving downstream can be processed either in the designated assembly stations or by pulling together the work teams of adjacent stations. This scheduling problem requires determining the mode of operation of each task, and the subsequent scheduling that preserves the flowshop constraints. We show that the problem is ordinary NP‐complete and obtain an optimal solution using a dynamic programming algorithm with considerable computational requirements for medium and large problems. Then, we present a number of dynamic programming relaxations and analyze their worst‐case error performance. Finally, we present a polynomial time heuristic with worst‐case error performance comparable to that of the dynamic programming relaxations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

A note on scheduling parallel machines subject to breakdown and repair

In this paper we consider n jobs and a number of machines in parallel. The machines are identical and subject to breakdown and repair. The number may therefore vary over time and is at time t equal to m(t). Preemptions are allowed. We consider three objectives, namely, the total completion time, ∑ C_j, the makespan C_max, and the maximum lateness L_max. We study the conditions on m(t) under which various rules minimize the objective functions under consideration. We analyze cases when the jobs have deadlines to meet and when the jobs are subject to precedence constraints. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

Numerical and experimental study on the response characteristics of warhead in the fast cook-off process

The response characteristics of the warhead under thermal stimuli conditions are important to the safety improvement. The goal of this study is to obtain data on the warhead in the fast cook-off process. In this paper, a numerical calculation method is proposed, whose reliability is supported by comparison with experimental results. Through the numerical calculation, the temperature distribution, temperature change, and ignition time are acquired. The numerical results show that the ignition time is 76 s after the warhead started to burn and that the maximum temperature of the explosive's outer surface is 238.3 C at the ignition time. The fast cook-off experiment of the warhead is implemented so as to get the flame temperature and reaction grades that are not available through numerical calculation. The experimental results show that the overpressure fails to reach the preset minimum value which is equivalent to 6 kg of TNT and that the reaction grade is deflagration. The research results have reference value for the design of the warhead and the reduction of detonation risks.     

解决深层次思想认识问题增强战斗精神教育实效性

增强战斗精神教育的实效性,必须以加强我军根本职能和军人职业道德教育为基本途径、以增强立足现有装备打胜仗的信心为重点、以增强各级干部的责任感和使命感为关键,并积极探索平时培育战斗精神的长效机制,解决官兵思想认识上存在的深层次问题.     

On parallel machine replacement problems with general replacement cost functions and stochastic deterioration

The parallel machine replacement problem consists of finding a minimum cost replacement policy for a finite population of economically interdependent machines. In this paper, we formulate a stochastic version of the problem and analyze the structure of optimal policies under general classes of replacement cost functions. We prove that for problems with arbitrary cost functions, there can be optimal policies where a machine is replaced only if all machines in worse states are replaced (Worse Cluster Replacement Rule). We then show that, for problems with replacement cost functions exhibiting nonincreasing marginal costs, there are optimal policies such that, in any stage, machines in the same state are either all kept or all replaced (No‐Splitting Rule). We also present an example that shows that economies of scale in replacement costs do not guarantee optimal policies that satisfy the No‐Splitting Rule. These results lead to the fundamental insight that replacement decisions are driven by marginal costs, and not by economies of scale as suggested in the literature. Finally, we describe how the optimal policy structure, i.e., the No‐Splitting and Worse Cluster Replacement Rules, can be used to reduce the computational effort required to obtain optimal replacement policies. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A generalization of the weighted set covering problem

We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect b‐matching problem. In general, we may use a polynomial‐time greedy heuristic similar to the one for the classical weighted set covering problem studied by D.S. Johnson [Approximation algorithms for combinatorial problems, J Comput Syst Sci 9 (1974), 256–278], L. Lovasz [On the ratio of optimal integral and fractional covers, Discrete Math 13 (1975), 383–390], and V. Chvatal [A greedy heuristic for the set‐covering problem, Math Oper Res 4(3) (1979), 233–235] to get an approximate solution for the problem. We find a worst‐case bound for the heuristic similar to that for the classical problem. In addition, we introduce a general type of probability distribution for the population of the problem instances and prove that the greedy heuristic is asymptotically optimal for instances drawn from such a distribution. We also conduct computational studies to compare solutions resulting from running the heuristic and from running the commercial integer programming solver CPLEX on problem instances drawn from a more specific type of distribution. The results clearly exemplify benefits of using the greedy heuristic when problem instances are large. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Distribution network design: Selection and sizing of congested connections

This paper focuses on certain types of distribution networks in which commodity flows must go through connections that are subject to congestion. Connections serve as transshipment and/or switching points and are modeled as M/G/1 queues. The goal is to select connections, assign flows to the connections, and size their capacities, simultaneously. The capacities are controlled by both the mean and the variability of service time at each connection. We formulate this problem as a mixed integer nonlinear optimization problem for both the fixed and variable service rate cases. For the fixed service rate case, we prove that the objective function is convex and then develop an outer approximation algorithm. For the variable service rate case, both mean and second moment of service time are decision variables. We establish that the utilization rates at the homogeneous connections are identical for an optimal solution. Based on this key finding, we develop a Lagrangian relaxation algorithm. Numerical experiments are conducted to verify the quality of the solution techniques proposed. The essential contribution of this work is the explicit modeling of connection capacity (through the mean and the variability of service time) using a queueing framework. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

军队党组织要崇尚法治,提高依法治军的本领

从严治军是古今中外治军之道的精要所在,依法治军是现代军队建设的一般规律。实践证明,只有坚持依法从严治军,才能从制度和法律上保证党对军队的绝对领导,保持人民军队的性质;保证军队的革命化、现代化、正规化建设的顺利发展,不断提高军队建设的现代化、正规化水平。军队各级党组织要深化认识,增强提高依法治军本领的自觉性;要正视差距,增强提高依法治军本领的紧迫感;要崇尚法治,努力提高依法从严治军的本领。其基本途径是:各级党组织要崇尚法治、摒弃人治,把坚持依法办事作为必具的本领素质;各级党组织要尊重规律、规范权力,走在依法治军的前列;要加强制度创新,为各级党组织依法治军提供可靠的合法性制度保证。