Mean sojourn times in multiclass feedback queues with gated disciplines

In this paper, we investigate multiclass feedback queues with gated disciplines. The server selects the stations by a nonpreemptive priority scheduling algorithm and serves customers in the selected station by either a gated FCFS discipline or a gated priority discipline. We take a rather systematic approach to their mean sojourn times. We define conditional expected sojourn times for all customers and derive their expressions from an analysis of busy periods. Since they are shown to be linear in some components of the system states, their steady state mean values can be derived from simple limiting procedures. These mean values can be obtained from a set of linear equations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 719–741, 2003.     

The effectiveness of the longest delivery time rule for the flow shop delivery time problem

In the flow shop delivery time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize maximum delivery completion time over all the jobs, where the delivery completion time of a job is the sum of its completion time, and the delivery time associated with that job. In this paper, we prove the asymptotic optimality of the Longest Delivery Time algorithm for the static version of this problem, and the Longest Delivery Time among Available Jobs (LDTA) algorithm for the dynamic version of this problem. In addition, we present the result of computational testing of the effectiveness of these algorithms. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

变负载变转速输入泵控马达调速系统

行车取力泵控马达发电系统可以改变现有装备车辆供电模式。针对泵控马达系统存在转速和外接负载扰动的问题,以输入变转速变负载变量泵-定量马达恒速控制系统为研究平台,建立系统的流量模型,确定了对转速和负载扰动的控制策略以及相应的前馈补偿系数,采用了PID闭环控制与前馈补偿相结合的复合控制方法。并通过Matlab的Simulink模块对建立系统的仿真模型,得到了系统在转速和负载扰动下的控制规律,结果表明控制系统在两种扰动下反应迅速,最后通过实验验证,马达输出转速能保持在较理想的状态,为行车取力发电系统实现提供了借鉴意义。     

Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017     

考虑地磁场空间梯度的飞行器磁干扰建模与求解方法

首先,在研究飞行器背景磁干扰模型与小信号模型的基础上,分析了地磁梯度沿纬度与高度的变化规律,分析可知由于飞行器的机动,地磁梯度会对测量结果造成影响;然后,考虑地磁梯度因素,对原有小信号模型求解方法进行了改进：飞行器在四个航向上做小角度的机动飞行,将地磁场沿纬度与高度的梯度作为未知量,与飞行器磁干扰模型中的剩磁参数、感磁参数和涡磁参数一起求解;最后,利用实测试验数据进行了验证,结果表明：考虑地磁梯度的影响与不考虑地磁梯度的影响相比,求解的模型参数可以在细节上进一步提高飞行器背景磁干扰的补偿效果。     

Impact of reseller's and sales agent's forecasting accuracy in a multilayer supply chain

We consider a three‐layer supply chain with a manufacturer, a reseller, and a sales agent. The demand is stochastically determined by the random market condition and the sales agent's private effort level. Although the manufacturer is uninformed about the market condition, the reseller and the sales agent conduct demand forecasting and generate private demand signals. Under this framework with two levels of adverse selection intertwined with moral hazard, we study the impact of the reseller's and the sales agent's forecasting accuracy on the profitability of each member. We show that the manufacturer's profitability is convex on the reseller's forecasting accuracy. From the manufacturer's perspective, typically improving the reseller's accuracy is detrimental when the accuracy is low but is beneficial when it is high. We identify the concrete interrelation among the manufacturer‐optimal reseller's accuracy, the volatility of the market condition, and the sales agent's accuracy. Finally, the manufacturer's interest may be aligned with the reseller's when only the reseller can choose her accuracy; this alignment is never possible when both downstream players have the discretion to choose their accuracy. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 207–222, 2014     

惯组动态测试台误差分析及附加运动补偿算法

为了完成惯组的高精度、大动态测试任务,基于Gough-Stewart平台设计了电动六自由度惯组动态测试台。建立了系统的误差模型并分析了电动缸长度误差对系统精度的影响,分析了电动缸在惯组动态测试台运动过程中产生的被动螺旋附加运动,并对该运动补偿算法进行了研究。对被动螺旋附加运动产生的误差进行量化分析,结果表明,被动螺旋附加运动对惯组动态测试台的位姿精度存在非常显著的影响。为了消除该影响,编制了补偿算法,并将其应用于惯组动态测试台的实时控制系统中。实验结果表明,经过算法补偿后,惯组动态测试台的位姿精度达到了设计指标要求。     

Asymptotic analysis of periodic policies for the inventory routing problem

In this article, a distribution system is studied where the sum of transportation and inventory costs is to be minimized. The inventory holding cost is assumed to be the same for all retailers. A fixed partition (FP) periodic policy is proposed with tight asymptotic worst‐case performance of 3/2 with respect to the best possible policy. This bound cannot be improved in the class of FP periodic policies. In partition‐based PB policies, the retailers are first partitioned into sets and then the sets are grouped in such a way that sets of retailers within a group are served together at selected times. A PB periodic, policy is presented with tight worst‐case asymptotic performance of with respect to the best possible policy. This latter performance improves the worst‐case asymptotic performance of of the previously best known policy for this problem. We also show that the proposed PB periodic policy has the best worst‐case asymptotic performance within the class of PB policies. Finally, practical heuristics inspired by the analyzed policies are designed and tested. The asymptotic worst–case performances of the heuristics are shown to be the same of those of the analyzed policies. Computational results show that the heuristics suggested are less than 6.4% on average from a lower bound on the optimal cost when 50 or more retailers are involved. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 00: 000–000, 2013     

振动对遥感载荷频率基准的影响及数字补偿技术研究

振动会导致雷达上晶体振荡器的工作频率发生变化,严重影响了雷达的工作性能。分析了振动对遥感卫星频率基准的影响机理,提出了针对加速度g的数字补偿技术。实验证明该方法可有效降低频率基准的加速度敏感性,在减小振动对频率基准影响方面具有广泛的应用前景。