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     

基于解析算法的声纳浮标搜潜系统定位精度分析

针对基于位置时间参数解析算法的声纳浮标阵搜潜系统的定位精度问题,采用定性和定量分析相结合的方法展开了研究。从解析定位模型出发,首先定性分析浮标自身的定位误差与传感器测时误差对航速及航向角计算的影响;然后选取评价指标,采用蒙特卡洛方法进行了仿真分析,得到了不同仿真条件下各个因素对定位精度具体的影响关系,这些结论为根据精度参数合理选择浮标阵的数量及布放阵型提供了依据。     

小口径速射舰炮武器系统反导射击方法研究

小口径速射舰炮受弹鼓容量及舰炮发射系统限制,一般不能在舰炮武器系统有效射击范围内全航路持续射击,这就要求对射击方法进行研究。应用蒙特卡洛法,在MATLAB软件平台上计算了小口径速射舰炮武器系统对匀速直线运动导弹的命中概率与弹丸相遇点距离间的关系,提出了以全航路最大概率命中导弹有效部位为基础制定射击终止点,反推射击起始点的射击方法,提高了舰炮武器系统在全航路射弹数限定条件下的命中概率;以舰炮武器系统跟踪器最大跟踪角速度限制因素为例,分析了导弹运动速度、航路捷径与射击区域的对应关系,并应用本方法对导弹典型航路的射击方案进行了仿真。仿真结果表明该方法在一定条件下能有效提高舰炮武器系统对导弹的全航路命中概率。     

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.     

THE F‐35 JOINT STRIKE FIGHTER AS A SOURCE OF INNOVATIon AND EMPLOYMENT: SOME INTERIM RESULTS

The F‐35 Joint Strike Fighter (JSF) programme is important for innovation in the Dutch economy and also contributes to other programmes in the aerospace industry (spin‐off) and other industries (spillover). On top of the expected value of US$9.2 billion in development and production, based on interviews with 10 companies and research institutes, an expected spin‐off of US$1.1 billion and an expected spillover of US$120 million will result. In addition, over 23,000 man‐years are associated with the activities in the development and production of the JSF. This study excludes the large and labour‐intensive Maintenance, Repair and Overhaul (MRO) activities. Further validation of data and an update of current results is planned for 2006.