Minimizing weighted mean absolute deviation of flow times in single machine systems

We discuss the problem of scheduling several jobs on a single machine with the objective of minimizing the weighted mean absolute deviation of flow times around the weighted mean flow time. We first show that the optimal schedule is W-shaped. For the unweighted case, we show that all optimal schedules are V-shaped. This characterization enables us to show that the problem is NP-hard. We then provide a pseudopolynomial algorithm for the unweighted problem. Finally, we consider three heuristic algorithms for the unweighted problem and report computational experience with these algorithms. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 297–311, 1998     

Stock-rationing policy for a make-to-stock production system with two priority classes and backordering

This article considers the problem of production control and stock rationing in a make-to-stock production system with two priority customer classes and backordering. The problem is formulated as a queueing control model. With Poisson arrivals and exponential production times, we show that the optimal production control and stock-rationing policies can be characterized by a single, monotone switching curve. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44 : 457–472, 1997     

雷达引信地杂波建模与仿真

介绍了一种用零记忆非线性变换(ZMNL)模拟具高斯谱特性的相参相关Weibull分布地杂波的方法,详细阐述了Weibull分布杂波随机序列产生的流程.仿真结果表明,该法形成的地杂波信号与理论值吻合较好,适合雷达引信的实际应用.     

Scheduling policies for an antiterrorist surveillance system

This article concerns scheduling policies in a surveillance system aimed at detecting a terrorist attack in time. Terrorist suspects arriving at a public area are subject to continuous monitoring, while a surveillance team takes their biometric signatures and compares them with records stored in a terrorist database. Because the surveillance team can screen only one terrorist suspect at a time, the team faces a dynamic scheduling problem among the suspects. We build a model consisting of an M/G/1 queue with two types of customers—red and white—to study this problem. Both types of customers are impatient but the reneging time distributions are different. The server only receives a reward by serving a red customer and can use the time a customer has spent in the queue to deduce its likely type. In a few special cases, a simple service rule—such as first‐come‐first‐serve—is optimal. We explain why the problem is in general difficult and we develop a heuristic policy motivated by the fact that terrorist attacks tend to be rare events. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Neutrino-Based Tools for Nuclear Verification and Diplomacy in North Korea

We present neutrino-based options for verifying that the nuclear reactors at North Korea’s Yongbyon Nuclear Research Center are no longer operating or that they are operating in an agreed manner, precluding weapons production. Neutrino detectors may be a mutually agreeable complement to traditional verification protocols because they do not require access inside reactor buildings, could be installed collaboratively, and provide persistent and specific observations. At Yongbyon, neutrino detectors could passively verify reactor shutdowns or monitor power levels and plutonium contents, all from outside the reactor buildings. The monitoring options presented here build on recent successes in basic particle physics. Following a dedicated design study, these tools could be deployed in as little as one year at a reasonable cost. In North Korea, cooperative deployment of neutrino detectors could help redirect a limited number of scientists and engineers from military applications to peaceful technical work in an international community. Opportunities for scientific collaboration with South Korea are especially strong. We encourage policymakers to consider collaborative neutrino projects within a broader program of action toward stability and security on the Korean Peninsula.     

Optimal inventory and dynamic admission policies for a retailer of seasonal products with affiliate programs and drop‐shipping

This article investigates the optimal inventory and admission policies for a “Clicks‐and‐Bricks” retailer of seasonal products that, in addition to selling through its own physical and online stores, also sells through third‐party websites by means of affiliate programs. Through postings on partners' webpages, an affiliate program allows a retailer to attract customers who would otherwise be missed. However, this retailer needs to pay a commission for each sale that originates from the website operators participating in the program. The retailer may also refer online orders to other sources (such as distributors and manufacturers) for fulfillment through a drop‐shipping agreement and thus earns commissions. This would be an option when, for example, the inventories at the physical stores were running low. Therefore, during the selling horizon, the retailer needs to dynamically control the opening/closing of affiliate programs and decide on the fulfillment option for online orders. On the basis of a discrete‐time dynamic programming model, the optimal admission policy of the retailer is investigated in this paper, and the structural properties of the revenue function are characterized. Numerical examples are given to show the revenue impact of optimal admission control. The optimal initial stocking decisions at the physical stores are also studied. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009