| 出厂物流调度问题及其启发式算法 |
| |
| 引用本文： | 于希嘉,陈峰.出厂物流调度问题及其启发式算法[J].上海交通大学学报,2008,42(9). |
| |
| 作者姓名： | 于希嘉 陈峰 |
| |
| 作者单位： | 上海交通大学工业工程与物流工程系,上海,200240 |
| |
| 基金项目： | 国家自然科学基金，国家自然科学基金 |
| |
| 摘 要： | 针对出厂物流调度问题,建立了一类出厂物流问题的调度理论模型,证明了该问题的强NP-hard特性.基于对问题的特征分析,提出求解问题的近似算法,证明了算法的最坏性能比为3且为紧界,并通过数值仿真验证了该算法的有效性.结果表明,所提出算法对两台流水作业机器的完工时间有一定的优化.
|
| 关 键 词： | 出厂物流 调度 启发式算法 计算复杂性 |
Outbound Scheduling Problem and Its Heuristic Algorithm |
| |
| YU Xi-jia,CHEN Feng.Outbound Scheduling Problem and Its Heuristic Algorithm[J].Journal of Shanghai Jiaotong University,2008,42(9). |
| |
| Authors: | YU Xi-jia CHEN Feng |
| |
| Abstract: | This paper studied the problem occurring in outbound logistics.The scheduling model for the problem was established,which moreover was proved to be strongly NP-hard.By analyzing the characters of the problem,a heuristic was presented and its worst performance ratio was proved to be 3 and tight.Computational experiments were given to show the efficiency of the algorithm. |
| |
| Keywords: | outbound logistics scheduling heuristic algorithm computational complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
