研究运输时间不确定环境下基于循环取料的越库调度问题.对问题建立不确定情况下求解该问题的混合整数规划模型;提出2阶段启发式算法和基于禁忌搜索算法的改进算法来获得近似最优解;通过在小规模和大规模情形下进行数值实验,验证了启发式算法的有效性.
This paper studied a milk run based cross docking scheduling problem with uncertain transportation time.By describing problem formally,a mixed integer linear programming is built under uncertain situation.A two-stage heuristic and a tabu search algorithm are presented.Numerical experiments under small and large scale situations are given to verify efficiencies of the proposed heuristics.