结果表明，所提出算法至少可以求解25个工件规模的越库配送排序问题。
The computational experiments show that the proposed DP algorithm can handle problems up to at least 25 jobs.
提出并研究两台机器环境下的以带权总完工时间为目标函数的越库配送排序问题。
This paper considers the cross docking distribution scheduling problem, with the objective to minimize the total weighted completion times.
提出并研究两台机器环境下的以带权总完工时间为目标函数的越库配送排序问题。
This paper considers the cross docking distribution scheduling problem, with the objective to minimize the total weighted completion times.
应用推荐