液体火箭发动机气液同轴式喷嘴混合特性实验研究

本文通过实验研究了液体火箭发动机气液同轴离心式喷嘴的混合特性。利用两相探针技术,测量了喷嘴下游喷雾流场中气液流强和混合比分布,考察了喷嘴缩进比和气液喷注压降等参数对混合特性的影响。结果表明,气液同轴离心式喷嘴的缩进比对喷嘴混合特性有较大影响,增大缩进比将导致更窄的气液流强分布和更均匀的混合,而改变气液喷注压降将导致不同的流强和混合比分布规律。     

A multiple‐shift workforce scheduling model under annualized hours

Many manufacturing and service organizations in Europe have used annualized hours, also known as flexiyear, to successfully tackle seasonal demand. Under annualized hours, the employer has a certain number of labor hours available in a year and the employer can allocate the hours over the year according to manpower need. A problem in planning for annualized hours is the scheduling of the workforce over the year. We present an algorithm to generate an annual schedule for a scenario in which a facility operates one or more shifts and manpower need may vary from week to week. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 726–736, 1999     

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     

背景音乐对人类学习效率影响的脑与行为研究进展

背景青乐是与主体的意识或行为无直接关系,通过非青乐鉴赏环境这一媒介间接作用于主体意识与行为的音乐。近些年来将背景音乐引入教育领域来探讨其对学习效率的影响是研究的新课题。从背景音乐对学习效率影响的相关理论、背景音乐对学习效率影响的实验研究以及背景音乐影响的研究趋势等方面进行了综述。     

孙子“慎战”思想对武警部队履行职能的启示

“慎战”是孙子军事思想中层次最高的战争决策思想,其理论主要包括不战思想、重战思想、善战思想和善后思想。在以和平与发展为主题的时代,孙子的“慎战”思想启示我们：要牢固树立“兵者,国之大事”的观念,加强部队现代化建设步伐,制定正确决策,“先为不可胜”;要以“非危不战”为原则,遏制犯罪,维护稳定,努力创造和平稳定的社会环境;要依据“胜于无形”,认真处理国内民族及其他矛盾,保持和谐稳定的社会环境。