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     

无奇点三维攻击时间控制滑模导引律

为研究导弹在视场角约束下的三维攻击时间控制问题,提出一种三维非线性滑模导引律。利用攻击时间误差设计滑模面,推导出三维形式的俯仰和偏航加速度指令;通过对所设计制导律进行简单修正,解决了零初始前置角引起的奇点问题;从数学上证明了该导引律的稳定性和收敛性,讨论了导引律相关参数的取值范围,分析了与纯比例导引法、解耦三维导引律之间的关系。仿真结果表明,所设计导引律能够在视场角约束条件下有效实现攻击时间增大或减小的控制;俯仰和偏航平面的耦合程度越强,该导引律控制能耗小的优势越为明显。     

Optimal maintenance policies for serial,multi‐machine systems with non‐instantaneous repairs

We study optimal age‐replacement policies for machines in series with non‐instantaneous repair times by formulating two nonlinear programs: one that minimizes total cost‐rate subject to a steady‐state throughput requirement and another that maximizes steady‐state throughput subject to a cost‐rate budget constraint. Under reasonable assumptions, the single‐machine cost‐optimal and throughput‐optimal solutions are unique and orderable, and the multi‐machine optimal solutions have appealing structure. Furthermore, we establish equivalence between the two formulations and provide an illustrative numerical example. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel

We consider the problem of scheduling orders on identical machines in parallel. Each order consists of one or more individual jobs. A job that belongs to an order can be processed by any one of the machines. Multiple machines can process the jobs of an order concurrently. No setup is required if a machine switches over from one job to another. Each order is released at time zero and has a positive weight. Preemptions are not allowed. The completion time of an order is the time at which all jobs of that order have been completed. The objective is to minimize the total weighted completion time of the orders. The problem is NP‐hard for any fixed number (≥2) of machines. Because of this, we focus our attention on two classes of heuristics, which we refer to as sequential two‐phase heuristics and dynamic two‐phase heuristics. We perform a worst case analysis as well as an empirical analysis of nine heuristics. Our analyses enable us to rank these heuristics according to their effectiveness, taking solution quality as well as running time into account. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

军校大学生社会主义荣辱观教育初探

在军校大学生中开展社会主义荣辱观教育,要着力抓好以下几个环节:加强理论研究,明确教育意义和目的;突出军队特色,提升道德水准;力求深化,通过拓宽教育形式切实提高学生的道德修养水平;着眼全局和长远,致力于营建和谐校园,以社会主义荣辱观教育为契机推进院校思想政治建设水平的整体跃升。     

AN ENDOGENOUS GROWTH MODEL OF CAPITAL AND ARMS ACCUMULATION

This paper attempts to examine the effect of an anticipated foreign military threat on the steady‐state growth rate and the transitional behavior of the economy. The modeling strategy follows the Sandler and Hartley (1995 Sandler, T. and Hartley, K. 1995. The Economics of Defense, Cambridge: Cambridge University Press.  [Google Scholar]) and Dunne et al. (2005 Dunne, J.P., Smith, R.P. and Willenbockel, D. 2005. Models of military expenditure and growth: a critical review. Defence and Peace Economics, 16: 449–461. [Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) viewpoints to emphasize the role of national defense in affecting growth from the perspective of both the demand and the supply sides. We thus combine the public capital version of endogenous growth with a framework of competitive arms accumulation. It is found that the key factor determining the steady state and the transitional effects of a rise in the foreign military threat on the home weapon–capital ratio, the consumption–capital ratio, and the rate of economic growth, is the degree of relative risk aversion.     

TERRORIST THREATS AND TRANSITIONAL DYNAMICS IN AN OVERLAPPING GENERATIONS MODEL

Previous research has shown that the duration of a civil war is in part a function of how it ends: in government victory, rebel victory, or negotiated settlement. We present a model of how protagonists in a civil war choose to stop fighting. Hypotheses derived from this theory relate the duration of a civil war to its outcome as well as characteristics of the civil war and the civil war nation. Findings from a competing risk model reveal that the effects of predictors on duration vary according to whether the conflict ended in government victory, rebel victory, or negotiated settlement.