PROTECTING CULTURAL MONUMENTS AGAINST TERRORISM

Famous cultural monuments are often regarded as unique icons, making them an attractive target for terrorists. Despite huge military and police outlays, terrorist attacks on important monuments can hardly be avoided. We argue that an effective strategy to discourage terrorist attacks on iconic monuments is for a government to show a firm commitment to swift reconstruction. Using a simple game‐theoretic model, we demonstrate how a credible claim to rebuild any destroyed cultural monument discourages terrorist attacks by altering the terrorists' expectations and by increasing the government's reputation costs if they fail to rebuild.     

A componentwise index of service measurement in multi‐component systems

In this paper we present a componentwise delay measure for estimating and improving the expected delays experienced by customers in a multi‐component inventory/assembly system. We show that this measure is easily computed. Further, in an environment where the performance of each of the item delays could be improved with investment, we present a solution that aims to minimize this measure and, in effect, minimizes the average waiting time experienced by customers. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 50: 2003     

Return policy: Hassle‐free or your money‐back guarantee?

This article compares the profitability of two pervasively adopted return policies—money‐back guarantee and hassle‐free policies. In our model, a seller sells to consumers with heterogeneous valuations and hassle costs. Products are subject to quality risk, and product misfit can only be observed post‐purchase. While the hassle‐free policy is cost advantageous from the seller's viewpoint, a money‐back guarantee allows the seller to fine‐tune the consumer hassle on returning the product. Thus, when the two return policies lead to the same consumer behaviors, the hassle‐free policy dominates. Conversely, a money‐back guarantee can be more profitable even if on average, high‐valuation consumers experience a lower hassle cost than the low‐valuation ones. The optimal hassle cost can be higher when product quality gets improved; thus, it is not necessarily a perfect proxy or signal of the seller's quality. We further allow the seller to adopt a mixture of these policies, and identify the concrete operating regimes within which these return policies are optimal among more flexible policies. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 403–417, 2014     

Minimizing makespan on a single batch processing machine with nonidentical job sizes

We deal with the problem of minimizing makespan on a single batch processing machine. In this problem, each job has both processing time and size (capacity requirement). The batch processing machine can process a number of jobs simultaneously as long as the total size of these jobs being processed does not exceed the machine capacity. The processing time of a batch is just the processing time of the longest job in the batch. An approximation algorithm with worst‐case ratio 3/2 is given for the version where the processing times of large jobs (with sizes greater than 1/2) are not less than those of small jobs (with sizes not greater than 1/2). This result is the best possible unless P = NP. For the general case, we propose an approximation algorithm with worst‐case ratio 7/4. A number of heuristics by Uzosy are also analyzed and compared. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 226–240, 2001     

基于虚拟布站和运动目标信源的时差控制模型

针对时差定位无源雷达战场目标模拟问题,构建了基于虚拟长基线布站和运动目标信源的时差控制模型,设计的新型时差调制模式,可满足时差信号生成设备的时差范围和精度要求,突破了时差定位无源雷达零基线状态无法定位的技术难题。基于该模型的战场目标模拟系统,实现了携有高精度时差信息的多路射频信号输出,能够为该类装备日常操作演练提供电磁环境支撑。     

On the availability of R out of N repairable systems

An R out of N repairable system consisting of N components and operates if at least R components are functioning. Repairable means that failed components are repaired, and upon repair completion they are as good as new. We derive formulas for the expected up‐time, expected down‐time, and the availability of the system, using Markov renewal processes. We assume that either the repair times of the components are generally distributed and the components' lifetimes are exponential or vice versa. The analysis is done for systems with either cold or warm stand‐by. Numerical examples are given for several life time and repair time distributions. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 483–498, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10025     

Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039     

Case‐based reasoning and improved adaptive search for project scheduling

Most scheduling problems are notoriously intractable, so the majority of algorithms for them are heuristic in nature. Priority rule‐based methods still constitute the most important class of these heuristics. Of these, in turn, parametrized biased random sampling methods have attracted particular interest, due to the fact that they outperform all other priority rule‐based methods known. Yet, even the “best” such algorithms are unable to relate to the full range of instances of a problem: Usually there will exist instances on which other algorithms do better. We maintain that asking for the one best algorithm for a problem may be asking too much. The recently proposed concept of control schemes, which refers to algorithmic schemes allowing to steer parametrized algorithms, opens up ways to refine existing algorithms in this regard and improve their effectiveness considerably. We extend this approach by integrating heuristics and case‐based reasoning (CBR), an approach that has been successfully used in artificial intelligence applications. Using the resource‐constrained project scheduling problem as a vehicle, we describe how to devise such a CBR system, systematically analyzing the effect of several criteria on algorithmic performance. Extensive computational results validate the efficacy of our approach and reveal a performance similar or close to state‐of‐the‐art heuristics. In addition, the analysis undertaken provides new insight into the behaviour of a wide class of scheduling heuristics. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 201–222, 2000