柔软物体力触觉形变模型验证系统

为了验证柔性物体力-形变模型的合理性,构建了基于CC2531芯片的无线数据收发平台、力传感器测量平台和FALCON手控器位移测量平台的力-形变模型验证系统。以新鲜猪肝脏为实验对象,研究了弹性形变实验和穿刺实验的作用力与位移之间的关系;以力-形变测量数据为基础,进行了参数验证校调。仿真实验结果表明:模型中力-形变特性与实际测量值保持一致。该系统能广泛应用于柔性物体力-形变模型验证,对于促进力触觉虚拟医学仿真系统的发展具有重要意义。     

岗位评价技术在公安边防部队干部量化考评中的应用初探

岗位评价是人力资源管理中的重点技术之一,是解决组织内岗位间相对公平性的重要工具。采用工作要素评分法,对边防检查站中层领导岗位进行了岗位评价实例操作,确定了岗位能级系数,推导出绩效考评综合评价计算公式,为岗位评价技术在边防部队干部量化考评中的应用提供了参考依据。     

Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines

We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

自由漂浮柔性机械臂系统的动力学建模与仿真

动量矩守恒约束使自由漂浮柔性机械臂系统成为非完整系统,其动力学模型通常是难以求解的微分—代数方程,因此提出将机械臂系统等效为一个完整系统进行建模。假设载体存在姿态控制力矩,此时由于不存在动量矩守恒约束,系统变成一个完整系统,采用Lagrange方法建立其动力学方程;令方程中载体的姿态控制力矩为零,即得到自由漂浮机械臂系统的动力学方程;采用数值方法求解动力学方程,并将动力学分析的结果与ADAMS中仿真的结果进行对比,验证了模型能够有效模拟自由漂浮柔性机械臂系统的动力学特性。     

Client‐contractor bargaining on net present value in project scheduling with limited resources

The client‐contractor bargaining problem addressed here is in the context of a multi‐mode resource constrained project scheduling problem with discounted cash flows, which is formulated as a progress payments model. In this model, the contractor receives payments from the client at predetermined regular time intervals. The last payment is paid at the first predetermined payment point right after project completion. The second payment model considered in this paper is the one with payments at activity completions. The project is represented on an Activity‐on‐Node (AON) project network. Activity durations are assumed to be deterministic. The project duration is bounded from above by a deadline imposed by the client, which constitutes a hard constraint. The bargaining objective is to maximize the bargaining objective function comprised of the objectives of both the client and the contractor. The bargaining objective function is expected to reflect the two‐party nature of the problem environment and seeks a compromise between the client and the contractor. The bargaining power concept is introduced into the problem by the bargaining power weights used in the bargaining objective function. Simulated annealing algorithm and genetic algorithm approaches are proposed as solution procedures. The proposed solution methods are tested with respect to solution quality and solution times. Sensitivity analyses are conducted among different parameters used in the model, namely the profit margin, the discount rate, and the bargaining power weights. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Energy‐efficient scheduling for sustainable manufacturing systems with renewable energy resources

Environmentally friendly energy resources open a new opportunity to tackle the problem of energy security and climate change arising from wide use of fossil fuels. This paper focuses on optimizing the allocation of the energy generated by the renewable energy system to minimize the total electricity cost for sustainable manufacturing systems under time‐of‐use tariff by clipping the peak demand. A rolling horizon approach is adopted to handle the uncertainty caused by the weather change. A nonlinear mathematical programming model is established for each decision epoch based on the predicted energy generation and the probability distribution of power demand in the manufacturing plant. The objective function of the model is shown to be convex, Lipchitz‐continuous, and subdifferentiable. A generalized benders decomposition method based on the primal‐dual subgradient descent algorithm is proposed to solve the model. A series of numerical experiments is conducted to show the effectiveness of the solution approach and the significant benefits of using the renewable energy resources.     

“尼罗河魔鬼”长背鳍波动包络线的提取算法

"尼罗河魔鬼"采用长背鳍波动推进方式,属于典型的奇鳍/对鳍推进鱼类.在已有的理论模型中,细长体理论(Elongated-body theory)较为适合于分析该类游动方式的推进性能.长背鳍的波动包络线方程是细长体理论的必要参数.拍摄实验样本(MPC-I)的自由游动视频,从中选取多组平稳运动图像序列,经旋转校正、零点配准、尺度归一、小波去噪等预处理后,提取了柔性长背鳍波动推进时的顶端边缘轮廓样本曲线簇,进而给出了波动包络曲线的多项式拟合方程.实验结果表明长背鳍波动包络线提取算法是有效的,根据算法所提取的长背鳍波动包络线方程为后续的推进力及推进效率的分析奠定了基础.     

Benders' cuts guided large neighborhood search for the traveling umpire problem

This article introduces the use of Benders' cuts to guide a large neighborhood search to solve the traveling umpire problem, a sports scheduling problem inspired by the real‐life needs of the officials of a sports league. At each time slot, a greedy matching heuristic is used to construct a schedule. When an infeasibility is recognized first a single step backtracking is tried to resolve the infeasibility. If unsuccessful, Benders' cuts are generated to guide a large neighborhood search to ensure feasibility and to improve the solution. Realizing the inherent symmetry present in the problem, a large family of cuts are generated and their effectiveness is tested. The resulting approach is able to find better solutions to many instances of this problem. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Polynomial‐time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

In this article, we consider the concurrent open shop scheduling problem to minimize the total weighted completion time. When the number of machines is arbitrary, the problem has been shown to be inapproximable within a factor of 4/3 ‐ ε for any ε > 0 if the unique games conjecture is true in the literature. We propose a polynomial time approximation scheme for the problem under the restriction that the number of machines is fixed. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Batch scheduling on a two‐machine jobshop with machine‐dependent setup times

The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m ≥ 3) is known to be strongly NP‐hard even with no setup times. We focus in this article on the two‐machine case. We assume UET jobs and consider batching with batch availability and machine‐dependent setup times. We introduce an efficient \begin{align*}(O(\sqrt{n}))\end{align*} algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011