| 越库物流调度问题及其近似与精确算法 |
| |
| 引用本文： | 陈峰,宋凯雷.越库物流调度问题及其近似与精确算法[J].工业工程与管理,2006,11(6):53-58. |
| |
| 作者姓名： | 陈峰 宋凯雷 |
| |
| 作者单位： | 上海交通大学,工业工程与管理系,上海,200240 |
| |
| 基金项目： | 国家自然科学基金
,
国家自然科学基金 |
| |
| 摘 要： | 在提出问题基础上,建立了基于在制品优化目标的调度模型;根据模型的不同调度特征,给出问题求解的启发式近似算法,并对算法的计算复杂性进行分析,提出问题精确求解的分枝定界算法;通过数值实验验证所给出算法的有效性.表明:分枝定界算法可以有效求解多达40个货物品种的准时制配送问题;启发式算法也具有较高的计算精度,为实际越库物流管理奠定算法基础.
|
| 关 键 词： | 越库 分枝定界法 近似算法 准时制物流 |
| 文章编号： | 1007-5429(2006)06-0053-06 |
| 收稿时间： | 2006-09-01 |
| 修稿时间： | 2006-11-01 |
Cross Docking Logistics Scheduling Problem and its Approximative and Precise Algorithms |
| |
| Chen Feng,Song Kai-lei.Cross Docking Logistics Scheduling Problem and its Approximative and Precise Algorithms[J].Industrial Engineering and Management,2006,11(6):53-58. |
| |
| Authors: | Chen Feng Song Kai-lei |
| |
| Affiliation: | Department of Industrial Engineering and Management, Shanghai Jiao Tong University, Shanghai 200240, China |
| |
| Abstract: | This paper studies cross docking scheduling problem occurring in just-in-time logistics. Firstly, a scheduling model with the WIP-based objective is proposed. Secondly, several heuristics are described to solve the problem according to its different characteristics, and the computational complexity is further analyzed. Moreover, a branch and bound algorithm is presen ted to get a precise solution. Finally, computational experiments are given to show the efficiency of these algorithms. Computational results show that the branch and bound algorithm can effectively solve the just-in-time distribution problem with up to 40 different products, and the heuristics have good computational performance too, which provide theoretical basis for cross docking logistics management in practice. |
| |
| Keywords: | cross docking branch and bound approximation algorithm JIT logistics |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
