非对称不确定性越库调度算法

Algorithm on Cross Docking Scheduling in Asymmetrically Uncertain Environment

在正态分布的模式下,对运输时间期望值进行修正,采用修正后的期望值计算确定性情形下的最优解以及不确定性情形下的现实解和最优解并分别加以比较,提出了期望值修正算法和基于修正期望值的启发式算法.采用最小化最大完工时间作为目标函数,研究了运输时间非对称不确定性条件下的直运物流调度问题.数值实验结果表明,因考虑了非对称性,所提出的修正策略的有效性和实用性较高.

Revised expected transportation time was used to calculate the optimum solution under a certain case,and the realistic solution and optimum solution under an uncertain case.The results were the compared respectively.In addition,the revised expectation algorithm and the heuristic algorithm based on revised expectation were proposed.Moreover,minimum makespan was used as the objective function to study the direct delivery logistics scheduling problem when transportation times were assumed to be asymmetrically uncertain.The results of the numerical experiment show that the revised strategy is effective and practical because of the consideration of asymmertry.