Two‐agent scheduling on a single sequential and compatible batching machine

We study two‐agent scheduling on a single sequential and compatible batching machine in which jobs in each batch are processed sequentially and compatibility means that jobs of distinct agents can be processed in a common batch. A fixed setup time is required before each batch is started. Each agent seeks to optimize some scheduling criterion that depends on the completion times of its own jobs only. We consider several scheduling problems arising from different combinations of some regular scheduling criteria, including the maximum cost (embracing lateness and makespan as its special cases), the total completion time, and the (weighted) number of tardy jobs. Our goal is to find an optimal schedule that minimizes the objective value of one agent, subject to an upper bound on the objective value of the other agent. For each problem under consideration, we provide either a polynomial‐time or a pseudo‐polynomial‐time algorithm to solve it. We also devise a fully polynomial‐time approximation scheme when both agents’ scheduling criteria are the weighted number of tardy jobs.     

Optimally scheduling interfering and non‐interfering cranes

This article treats the problem of scheduling multiple cranes processing jobs along a line, where cranes are divided into different groups and only cranes in the same group can interfere with each other. Such crane scheduling problems occur, for example, at indented berths or in container yards where double rail‐mounted gantry cranes stack containers such that cranes of the same size can interfere with each other but small cranes can pass underneath larger ones. We propose a novel algorithm based on Benders decomposition to solve this problem to optimality. In a computational study, it is shown that this algorithm solves small and medium‐sized instances and even many large instances within a few seconds or minutes. Moreover, it improves several best known solutions from the literature with regard to the simpler problem version with only one crane group. We also look into whether investment in more complicated crane configurations with multiple crane groups is actually worthwhile.     

基于反射内存网的复合导引头联合仿真试验设计

联合仿真试验同时具备实装试验、数学仿真试验和半实物仿真试验的优点,可构建全面逼真的试验环境,其中实时算法和通信技术是关键技术。基于反射内存网技术,进行了复合导引头联合仿真试验总体方案设计,对试验中的时间同步、数据同步等关键问题进行了研究,解决了联合仿真试验中各仿真系统协同及实时通信问题,对联合仿真试验的开展有一定的应用价值。     

大型电子装备层次诊断应用研究

根据电子装备诊断的特点,探讨了利用层次性理论对电子装备进行故障诊断的必要性和可行性,给出了层次性诊断中层间诊断和层内诊断的概念、原理及实现方法。首次将可列集的概念引用到层次诊断中,并给出了层次诊断中故障模式空间的选取原则,为层次诊断的工程实现和未来进行多信息诊断提供了基本框架。     

测试点的选取问题

在故障检测的过程中 ,每个测试点检测需要的时间可能不同。本文研究了如何选取一些测试点 ,使得这些测试点可以检测所有故障 ,而所需时间最少的问题。我们将其转化成整数规划问题 ,并给出一个求解算法 .最后给出一个实例对算法加以说明。     

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     

An interactive procedure for selecting acceptable alternatives in the presence of multiple criteria

In this paper, we consider the multiple criteria decision‐making problem of partitioning alternatives into acceptable and unacceptable sets. We develop interactive procedures for the cases when the underlying utility function of the decision maker is linear, quasiconcave, and general monotone. We present an application of the procedures to the problem of admitting students to the master's degree program at the Industrial Engineering Department, Middle East Technical University. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 592–606, 2001.     

子自仿射集的Hausdorff维数

设S1,S2 ,… ,SN 是Rn 上的N个仿射压缩映射 ,若Rn 的紧子集E满足E UNi =1 Si(E) ,则称E为子自仿射集 .作者在一定条件下得到了子自仿射集E的Hausdorff维数 .     

粗集理论在目标识别信息处理中的应用

为提取传感器获得的较粗糙的原始信息,运用粗集理论进行目标识别信息的处理,提出了一种采用关系表存储原始信息,通过简化关系表删去冗余信息,从而达到提取有用信息的处理方法.根据此方法,实例中通过对生成的规则进行优选,得到了简单准确的目标识别规则.此理论在信息处理中的应用,较好地满足了目标识别中原始信息处理的需求.     

Land power in the age of joint interdependence: toward a theory of land power for the twenty-first century*

This essay outlines a theory of land power. After explaining the absence of such a theory, the article establishes the modern context for such a theory, specifically within the concept of joint interdependence. The analysis defines key terms and premises behind the theory, to include a definition of land power. The argument then outlines the national elements of power that contribute to a theory of land power. The analysis next applies the theory to the fundamental purposes of military power: defeat, deter, compel, assure, shape and support to the nation. The analysis then tests key definitions, supporting premises, and utility of the theory. The essay argues that historical experience validates the applicability and utility of the theory, and offers a solid basis for extrapolating the validity of the theory into the near future.