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     

非线性随机动态响应的高效模拟方法

提出了一种分析多自由度非线性系统在随机激励下响应的高效模拟方法。该方法以蒙特卡罗方法为基础,针对动态问题,建立了有效的重要性判别准则,采用俄罗斯轮盘赌与分裂方法来处理响应样本,增加了样本在低失效概率区域出现的几率,提高了模拟效率。通过两个算例表明,该方法操作简单,可以大大地减少计算量,能够适用于实际的工程问题。     

一类非线性系统极限环的讨论与应用

用平面自治系统的极限环理论和分支理论研究了一类具有普遍意义的非线性系统,讨论了该系统极限环的存在性和唯一性,同时解决了系统极限环的个数和分布问题。应用所得结论,推广并改进了前人的结果。     

A stochastic programming approach for chemotherapy appointment scheduling

Chemotherapy appointment scheduling is a challenging problem due to the uncertainty in premedication and infusion durations. In this paper, we formulate a two‐stage stochastic mixed integer programming model for the chemotherapy appointment scheduling problem under limited availability of nurses and infusion chairs. The objective is to minimize the expected weighted sum of nurse overtime, chair idle time, and patient waiting time. The computational burden to solve real‐life instances of this problem to optimality is significantly high, even in the deterministic case. To overcome this burden, we incorporate valid bounds and symmetry breaking constraints. Progressive hedging algorithm is implemented in order to solve the improved formulation heuristically. We enhance the algorithm through a penalty update method, cycle detection and variable fixing mechanisms, and a linear approximation of the objective function. Using numerical experiments based on real data from a major oncology hospital, we compare our solution approach with several scheduling heuristics from the relevant literature, generate managerial insights related to the impact of the number of nurses and chairs on appointment schedules, and estimate the value of stochastic solution to assess the significance of considering uncertainty.     

复合材料层合结构的非线性传热分析

基于一阶热层合理论,考虑材料非线性的影响,建立了复合材料层合结构非线性传热分析的热层合理论及其有限元方程.通过数值算例研究了材料非线性对反对称复合材料层合板瞬态温度场的影响.     

两段探测目标的传感器任务调度问题0-1规划模型及算法

为解决指挥系统控制中的调度困难,研究了一类特殊的传感器资源调度问。主要分析了跟踪目标的探测次数、时间间隔和传感器资源等约束条件。用跟踪目标的重要程度之和作为目标函数,建立了一个0-1规划的数学模型,再利用变换将其转化为0-1线性整数规划模型。利用割平面法求解得出最优调度策略,其能在工作量饱和的情况下合理调度传感器资源。为提高求解速度,提出了对应的模拟退火算法。通过对一些不同规模实例的求解,在资源利用率和算法的求解速度等指标上,与割平面法及遗传算法进行对比分析,验证了模型的有效性和模拟退火算法求解的高效性。     

二维非线性正交各向异性材料的瞬态热传导反问题数值方法

针对正交各向异性材料的二维非线性热传导反问题,采用顺序函数法进行表面热流辨识问题的研究。在求解反问题时,采用有限体积法、牛顿-拉夫逊法并引入未来时间步的概念。在每个时间步内,将待辨识热流视为非线性方程组的未知量,通过一个迭代过程进行求解。算例的研究表明,热流辨识结果与真实热流相近,从而证明了本方法在辨识二维非线性热传导反问题时是准确、稳定、有效的。     

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.     

数据并行程序设计语言中分布数组的地址计算

本文讨论了在大规模并行计算机上实现数据并行程序设计语言的关键问题──分布数组的地址计算问题。文中详细给出了维分布数组的下标地址计算公式,分布数组的内情向量结构以及分布数组映射函数算法,并对有关编译实现技术进行了探讨。     

坦克稳定器的自抗扰控制算法

为解决坦克稳定器中存在的传动间隙、干摩擦等强非线性问题,提高系统的鲁棒性,基于自抗扰控制器(ADRC)原理,提出了适用于坦克稳定器的自抗扰控制器,并进行了计算机仿真和试验验证。证明了自抗扰控制算法在坦克稳定器设计中的可行性。