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.