Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures

In this paper, we study the problem of scheduling quay cranes (QCs) at container terminals where incoming vessels have different ready times. The objective is to minimize the maximum relative tardiness of vessel departures. The problem can be formulated as a mixed integer linear programming (MILP) model of large size that is difficult to solve directly. We propose a heuristic decomposition approach to breakdown the problem into two smaller, linked models, the vessel‐level and the berth‐level models. With the same berth‐level model, two heuristic methods are developed using different vessel‐level models. Computational experiments show that the proposed approach is effective and efficient. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Evaluation of infrared camouflage effectiveness via a multi-fractal method

This paper reports an alternative approach to the evaluation of infrared camouflage effectiveness via a multi-fractal method. By calculating multi-fractal spectra of the target region and the background re-gions in an infrared image, the spectrum shape features and the discrete Fréchet distances among these spectra were used to analyze the camouflage effectiveness of the target qualitatively and quantitatively, and the correlation coefficients of the spectra were further used as the index of camouflage effectiveness. It was found that the camouflaged target had better camouflage effectiveness than the target without camouflage in the same one background, and the same one camouflaged target had different camouflage effectiveness in different backgrounds. On the whole, the target matching well with its background had high camouflage effectiveness value. This approach can expand the application of multi-fractal theory in infrared camouflage technology, which should be useful for the research of infrared camouflage mate-rials, the design of camouflage patterns as well as the deployment of military equipment in battlefield.     

地形相关算法度量值的统计特性

考虑到地形相关匹配算法度量值统计特性与二维地形自相关系数的关系，本文提出一种改进的约翰逊方法——相关地形下的匹配算法度量值统计特性分析方法。首先，基于约翰逊方法的问题框架，修改其中基准数据的相邻像元值相互独立的假设，导出了地形相关 Ｍ Ｓ Ｄ 算法度量值的统计分布的解析函数。然后，讨论了约翰逊方法与本文方法的适用性，指出了约翰逊方法的不足之处。最后，给出了本文方法在地形可匹配性分析中的一种应用。     

线性调频基带数字产生的关键技术研究

介绍超宽带线性调频信号基带的数字产生方法及其实现技术。首先对线性调频信号的两种主要数字产生方法进行了简要阐述和比较，然后根据波形存储直读法提出了一种超宽带线性调频信号产生方案，分析了基带数字产生的主要关键技术，并进行了系统实现和测试。测试结果表明本文所提出的方法是可行的。     

Bullwhip and reverse bullwhip effects under the rationing game

When an unreliable supplier serves multiple retailers, the retailers may compete with each other by inflating their order quantities in order to obtain their desired allocation from the supplier, a behavior known as the rationing game. We introduce capacity information sharing and a capacity reservation mechanism in the rationing game and show that a Nash equilibrium always exists. Moreover, we provide conditions guaranteeing the existence of the reverse bullwhip effect upstream, a consequence of the disruption caused by the supplier. In contrast, we also provide conditions under which the bullwhip effect does not exist. In addition, we show that a smaller unit reservation payment leads to more bullwhip and reverse bullwhip effects, while a large unit underage cost results in a more severe bullwhip effect. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 203–216, 2017     

Performance analysis of the cultural and creative industry: a network‐based approach

The cultural and creative industries (CCIs) in Taiwan have gradually contributed to the national economy under the impetus of government policies. We employ a two‐stage data envelopment analysis model with an additive efficiency decomposition approach to measure the profitability and marketability of 22 Taiwanese cultural and creative companies. Furthermore, we employ the network‐based ranking approach to identify benchmark inputs/outputs, and the strengths and weakness of each company. Our empirical results show that the profitability of the cultural and creative companies is better than their marketability. Companies in the industries of publishing, creative life, popular music, and cultural content averagely perform better than those in the other three types of CCIs in terms of profitability. Companies in the creative life industry are on average more efficient than those in the other five types of CCIs in terms of marketability. The profitability/marketability matrix of cultural and creative companies is also presented.     

On the busy period of the M/G/1 retrial queue

The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he finds the server free. We focus on the busy period L of the M/G/1$ retrial queue. The structure of the busy period and its analysis in terms of Laplace transforms have been discussed by several authors. However, this solution has serious limitations in practice. For instance, we cannot compute the first moments of L by direct differentiation. This paper complements the existing work and provides a direct method of calculation for the second moment of L. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 115–127, 2000     

New results on a Ruckle problem in discrete games of ambush

This article deals with a two‐person zero‐sum game in which player I chooses in integer interval [1, N] two integer intervals consisting of p and q points where p + q < N, and player II chooses an integer point in [1, N]. The payoff to player I equals 1 if the point chosen by player II is at least in one of the intervals chosen by player II and 0 otherwise. This paper complements the results obtained by Ruckle, Baston and Bostock, Lee, Garnaev, and Zoroa, Zoroa and Fernández‐Sáez. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 98–106, 2001     

A single‐period inventory placement problem for a serial supply chain

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:506–517, 2001     

General multiprocessor task scheduling

Most papers in the scheduling field assume that a job can be processed by only one machine at a time. Namely, they use a one‐job‐on‐one‐machine model. In many industry settings, this may not be an adequate model. Motivated by human resource planning, diagnosable microprocessor systems, berth allocation, and manufacturing systems that may require several resources simultaneously to process a job, we study the problem with a one‐job‐on‐multiple‐machine model. In our model, there are several alternatives that can be used to process a job. In each alternative, several machines need to process simultaneously the job assigned. Our purpose is to select an alternative for each job and then to schedule jobs to minimize the completion time of all jobs. In this paper, we provide a pseudopolynomial algorithm to solve optimally the two‐machine problem, and a combination of a fully polynomial scheme and a heuristic to solve the three‐machine problem. We then extend the results to a general m‐machine problem. Our algorithms also provide an effective lower bounding scheme which lays the foundation for solving optimally the general m‐machine problem. Furthermore, our algorithms can also be applied to solve a special case of the three‐machine problem in pseudopolynomial time. Both pseudopolynomial algorithms (for two‐machine and three‐machine problems) are much more efficient than those in the literature. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 57–74, 1999