| 越库作业调度问题及其启发式算法研究 |
| |
| 引用本文： | 马东彦.越库作业调度问题及其启发式算法研究[J].物流技术,2007,26(6):57-59. |
| |
| 作者姓名： | 马东彦 |
| |
| 作者单位： | 宁夏大学机械工程学院,宁夏,银川,750021 |
| |
| 摘 要： | 主要研究两台机器环境下的以加权完工时间和为目标函数的越库调度问题。首先针对两机器越库调度问题进行研究与分析,给出该问题最优解的若干性质;其次,基于最优解的性质,提出求解该问题的启发式算法,并在此基础上对所给算法进行改进;最后,通过数值实验与动态规划算法比较,证明所给算法及其改进算法的有效性。
|
| 关 键 词： | 物流 调度 启发式算法 越库 配送 |
| 文章编号： | 1005-152X（2007）06-0057-03 |
| 收稿时间： | 2007-03-21 |
| 修稿时间： | 2007-03-21 |
Heuristic Algorithm Solving Cross Docking Distribution Problem |
| |
| MA Dong-yan.Heuristic Algorithm Solving Cross Docking Distribution Problem[J].Logistics Technology,2007,26(6):57-59. |
| |
| Authors: | MA Dong-yan |
| |
| Institution: | School of Machinery Engineering; Ningxia University; Yinchuan 750021; China |
| |
| Abstract: | The paper studies the schedule problem of cross docking distribution in the situation of two machines,which objective function is the total weighted completion time.First,it studies the computational complexity and some features of optimal solution;Second,a heuristic algorithm is developed;and at last,the computational experiment shows that the heuristic algorithm and the improved algorithm have better effect. |
| |
| Keywords: | logistics scheduling heuristic algorithm cross docking distribution |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
