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.     

Scheduling parallel dedicated machines with the speeding‐up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two‐machine problem is NP‐hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst‐case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple‐choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

几何约束的改进弹性体网格变形方法研究及应用

针对现有弹性体网格变形方法无法有效抑制网格单元出现"负体积"和过度畸变等问题,引入体积弹性模量约束和挤压弹性模量约束,提出一种基于几何约束的改进弹性体法。借助Patrick网格质量参数,选取三维长方体边界在旋转、平移和伸展变形三种方式下的大幅度运动,对比研究引入几何约束后的改进效果。仿真计算二维NACA0012翼型的俯仰振荡和三维伸缩翼变形过程的气动特性,结果表明:基于几何约束的改进弹性体法显著提高了变形网格的鲁棒性,尤其在大变形时能够有效约束较差网格单元,改善经典方法存在的问题,可为非定常流场问题的求解提供有力支撑。     

子空间预测控制在固体氧化物燃料电池中的应用

为使固体氧化物燃料电池(SOFC)输出满足一定约束的稳定电压、提高其输出功率跟踪性能,采用文献中给出的SOFC动态模型,设计了基于子空间矩阵的预测控制器。将子空间辨识和预测控制算法结合起来,直接从开环输入输出数据获得预测控制器的控制矩阵,而不须经过中间参数模型辨识的步骤。仿真结果验证了所提子空间预测控制算法(SPC)的实用性。     

Complexity and workload considerations in product mix decisions under the theory of constraints

The literature on the product mix decision (or master production scheduling) under the Theory of Constraints (TOC), which was developed in the past two decades, has addressed this problem as a static operational decision. Consequently, the developed solution techniques do not consider the system's dynamism and the associated challenges arising from the complexity of operations during the implementation of master production schedules. This paper aims to address this gap by developing a new heuristic approach for master production scheduling under the TOC philosophy that considers the main operational factors that influence actual throughput after implementation of the detailed schedule. We examine the validity of the proposed heuristic by comparison to Integer Linear Programming and two heuristics in a wide range of scenarios using simulation modelling. Statistical analyses indicate that the new algorithm leads to significantly enhanced performance during implementation for problems with setup times. The findings show that the bottleneck identification approach in current methods in the TOC literature is not effective and accurate for complex operations in real‐world job shop systems. This study contributes to the literature on master production scheduling and product mix decisions by enhancing the likelihood of achieving anticipated throughput during the implementation of the detailed schedule. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 357–369, 2015     

电子对抗电磁环境的矩阵对策评估方法

为提高复杂电磁环境下的作战能力,对其进行复杂度评估是必须首要解决的课题。在分析战场复杂电磁环境评估基本方法的基础上,提出了一种基于矩阵对策的战场复杂电磁环境评估方法,建立了评估的模型,并通过一个电子对抗训练的场景,合理构建了支付矩阵,验证了评估方法的有效性。该方法可以反映作战过程的动态变化,同时为作战决策提供依据,可以有效提高战场决策水平和作战训练水平。     

带运力限制及单边时变约束下多出发机场航空战略投送兵力分配模型研究

利用民航力量由多个机场向一个目标机场实施航空战略投送时,由于各民航机场都具有运力限制约束,不可能无限制地快速投送兵力,因此,考虑了在多个出发机场存在运力限制约束的情况下,构建了"投送时间最短,动员机场最少"多目标决策模型,并给出了优化算法和算例.     

基于粗糙集理论的定性推理结果的约束

从分析定性推理结果存在的问题出发,提出定性约束的必要性.总结了几种现有的定性约束,提出一种新的定性约束-粗糙定性约束,利用粗糙集属性约简算法对定性推理结果进行约简.简要介绍了粗糙定性推理软件的总体设计思路流程和功能模块划分.以物资供应保障过程定性推理结果为例,对所得推理结果进行粗糙定性约束,得到重要推理结果,为物资供应保障决策提供参考意见.     

Determining crane areas for balancing workload among interfering and noninterfering cranes

This article treats the problem of subdividing an area for storing containers such that the workload is evenly shared among the cranes operating the resulting subareas. We consider two crane sets: while noncrossing constraints between cranes of the same set need to be observed, cranes of different sets do not interfere. Such a problem setting is, for instance, relevant for scheduling the (un‐)loading of vessels by parallel quay cranes operating on opposing berths or in container yards with cross‐over cranes. We formalize the resulting optimization problem, prove computational complexity, and present exact and heuristic solution procedures. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

利用迭代线性约束最小二乘方法实现不规则阵列的方向图综合

研究了用自适应波束形成技术实现不规则阵列的方向图综合问题,改进了应用于方向图综合的迭代线性约束最小二乘方法,改进后的算法提高了数值稳定性和对随机稀疏阵的适应性。对特定的阵列如果指定的理想方向图无法达到,该算法可以获得最好的逼近。仿真结果验证了算法的性能。