不确定环境下的越库调度的模型及算法

Uncertain Cross Docking Scheduling:Models and Algorithms

研究不确定环境下的直运入厂物流调度问题。目标函数是最小化最大完工时间。供应商和客户到配送中心的运输时间的期望值和方差已知,运输时间均服从正态分布。首先研究确定性和不确定情形下的最优解差距。然后提出适用于确定和不确定情形下的带参数启发式算法,并给出面向不确定性环境的较优启发式算法,数值实验表明该算法的有效性。

This paper studies uncertain inbound cross docking scheduling problem. The objective is to minimize makespan. TEe transportation time from suppliers or customers to cross docking distribution center follows normal distribution. The difference of optimal objective between certain and uncertain environment is first analyzed. Several heuristics for both certain and uncertain environment are proposed. A heuristic specialized insolving uncertain problem is constructed, and computational tests show that the heuristic is more efficient than others.