Multidirectional scheduling scheme in resource‐constrained project schedulingproblem

In 2000, Klein showed that bidirectional scheduling schemes (bidss) outperform single‐directional scheduling schemes (e.g., forward or backward schemes). In 2010, Yoosefzadeh, et al. [J Math Model Algor 9 (2010), 357–373] showed that depending on the nature of the problems and also the type of priority rules used, schedules produced by a so‐called tridirectional scheduling scheme (trdss) yields shorter makespans when compared to forward, backward, and even bidss. Since the justification technique is applied in many of the state‐of‐the‐art algorithms nowadays, we show that the tuned version of the trdss outperforms the double justification technique. Moreover, we investigate the circumstances under which the trdss is more probable to generate schedules with shorter makespans. To this end, we introduce a new measure of resource requirements and their distributions, namely total amount of overflows. Our analytical as well as empirical investigations show that when the new measure is increased, it is more probable to obtain schedules with shorter makespans using the trdss. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 61: 44–55, 2014     

应用压力间断解析解修正AUSM+-up格式

AUSM+-up格式是近年来发展的AUSM类格式,通过在对流通量中引入压力耗散,同时在压力通量中引入速度耗散,使之在各种马赫数下均有良好的收敛性和稳定性。然而,通过对格式的分析,我们发现当马赫数为零时,在压力间断位置会出现质量通量无穷大的非物理现象。为了克服这一缺陷,采用特征线法获得了压力间断问题的解析解;以此为基础,对对流通量中的压力耗散项进行修正,发展出新的AUSM+-up格式。以新的格式对不同速度驱动下的冲击波发展、不同强度压力间断问题和激波衍射问题进行了仿真,计算结果与理论解吻合得较好。     

基于群决策协同网络信息的掩护机编队选择

针对任务机群中掩护机编队的选择,用群决策协同网络信息模型进行了掩护机编队的选择。首先,给出了协同网络、模糊数和语言变量的相关概念;其次,分析了掩护机编队选择的指标体系框架和协同网络信息框架;然后,构建了群决策协同网络信息的数学模型,在此基础上,给出了方案选择的步骤;最后,运用该模型对掩护机编队的选择进行求解。结果表明：该模型能够综合群体专家的知识,解决掩护机编队选择中的定性判断问题。该模型可用于个体指标和协同指标均为定性指标时的方案优选问题。     

Solving generalized transportation problems via pure transportation problems

This paper investigates certain issues of coefficient sensitivity in generalized network problems when such problems have small gains or losses. In these instances, it might be computationally advantageous to temporarily ignore these gains or losses and solve the resultant “pure” network problem. Subsequently, the optimal solution to the pure problem could be used to derive the optimal solution to the original generalized network problem. In this paper we focus on generalized transportation problems and consider the following question: Given an optimal solution to the pure transportation problem, under what conditions will the optimal solution to the original generalized transportation problem have the same basic variables? We study special cases of the generalized transportation problem in terms of convexity with respect to a basis. For the special case when all gains or losses are identical, we show that convexity holds. We use this result to determine conditions on the magnitude of the gains or losses such that the optimal solutions to both the generalized transportation problem and the associated pure transportation problem have the same basic variables. For more general cases, we establish sufficient conditions for convexity and feasibility. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 666–685, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10034     

The probability of the existence of a feasible flow in a stochastic transportation network

Stochastic transportation networks arise in various real world applications, for which the probability of the existence of a feasible flow is regarded as an important performance measure. Although the necessary and sufficient condition for the existence of a feasible flow represented by an exponential number of inequalities is a well‐known result in the literature, the computation of the probability of all such inequalities being satisfied jointly is a daunting challenge. The state‐of‐the‐art approach of Prékopa and Boros, Operat Res 39 (1991) 119–129 approximates this probability by giving its lower and upper bounds using a two‐part procedure. The first part eliminates all redundant inequalities and the second gives the lower and upper bounds of the probability by solving two well‐defined linear programs with the inputs obtained from the first part. Unfortunately, the first part may still leave many non‐redundant inequalities. In this case, it would be very time consuming to compute the inputs for the second part even for small‐sized networks. In this paper, we first present a model that can be used to eliminate all redundant inequalities and give the corresponding computational results for the same numerical examples used in Prékopa and Boros, Operat Res 39 (1991) 119–129. We also show how to improve the lower and upper bounds of the probability using the multitree and hypermultitree, respectively. Furthermore, we propose an exact solution approach based on the state space decomposition to compute the probability. We derive a feasible state from a state space and then decompose the space into several disjoint subspaces iteratively. The probability is equal to the sum of the probabilities in these subspaces. We use the 8‐node and 15‐node network examples in Prékopa and Boros, Operat Res 39 (1991) 119–129 and the Sioux‐Falls network with 24 nodes to show that the space decomposition algorithm can obtain the exact probability of these classical examples efficiently. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 479–491, 2016     

基于蝙蝠算法的多目标战备物资调运决策优化

战备物资的调运是部队后勤工作中十分重要的一环,面对复杂多变的战场环境,战备物资调运必须进行科学合理的决策优化。然而现有战备物资调运模型的优化模型较为复杂,如果涉及较多供应点和目标要求则不易实现。针对涉及多个调运点的多目标战备物资调运问题,提出一种新的决策优化模型,利用启发式蝙蝠算法进行优化计算,发挥出蝙蝠算法易于实现、性能优越的特点,较好地解决了涉及较多供应点的多目标战备物资调运决策优化问题,并结合一个仿真算例,证明该方法相对于其他方法更具简易性和有效性。     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于可变权重模糊集的搜索方案模糊决策模型

运用模糊决策理论,研究了反潜巡逻机在执行反潜任务时,从多种搜潜手段及其组合中选择合理的搜潜方案的决策模型,特别是针对声纳浮标为消耗性器材的特点,引入了基于AHP方法思想的、与声纳浮标存有量有关的可变因素权重模糊集向量,通过计算和判断各种备选方案与理想方案之间的模糊距离,建立了针对不同航行状态潜艇的搜索行动方案优选模型,最后给出了决策算例,验证了模糊决策模型的合理性,可应用于反潜巡逻机作战指挥的计算机辅助决策.     

一种基于低扩散通量分裂方法的WENO格式研究

将低扩散通量分裂格式(LDFSS)和加权基本无振荡格式(WENO)相结合,构造出一种混合格式,其中WENO格式用于物理量重构,而LDFSS用于通量分裂。采用这种格式对Riemann问题、钝头体高超声速无粘绕流流场进行了计算,并对超声速平板湍流边界层进行了混合LES/RANS模拟,计算结果表明:相对于采用Lax-Fridrichs分裂的WENO格式来说,这种混合格式对于激波和接触间断的分辨率更高,并且在标量保正性方面更优,收敛性更好;而相对于采用带有Minmod限制器的MUSCL方法进行物理量高阶重构的LDFSS格式来说,这种混合格式在混合模拟的计算中能够更好地反映湍流流场的脉动特性,计算得到的湍流速度脉动量的统计值更加准确。     

基于熵权多目标决策的战时物资运输方案优选研究

提出了战时物资运输方案优选问题,分析战时运输的影响因素,提出了评估战时物资运输方案的较有代表性的指标,并给出了具体计算方法.在没有指标权重的情况下,应用熵权多目标决策方法对多个合理方案进行优选评估,得出了可信度较高的优选方案.