| 一种并行机的生产运输协调调度的启发式算法 |
| |
| 引用本文： | 宫华,陈大亨.一种并行机的生产运输协调调度的启发式算法[J].沈阳理工大学学报,2006,25(1):43-45. |
| |
| 作者姓名： | 宫华 陈大亨 |
| |
| 作者单位： | 沈阳理工大学,理学院,辽宁,沈阳,110168 |
| |
| 摘 要： | 研究了供应链的整合系统中机器调度与产品运输的协调调度问题,尤其是在同等并行机器生产下,运输资源有限时,考虑产品运输到客户的过程中工件占有不同的存储空间问题,证明了该问题是强NP-hard的,提出一种启发式算法,并对此进行了最坏情况的性能比分析,得到紧界是2.
|
| 关 键 词： | 调度 运输 NP-hard 启发式 |
| 文章编号： | 1003-1251(2006)01-0043-03 |
| 修稿时间： | 2005年5月26日 |
A Heuristic Algorithm on Parallel Machine of Production-Transportation Scheduling |
| |
| GONG Hua,CHEN Da-heng.A Heuristic Algorithm on Parallel Machine of Production-Transportation Scheduling[J].Transactions of Shenyang Ligong University,2006,25(1):43-45. |
| |
| Authors: | GONG Hua CHEN Da-heng |
| |
| Abstract: | The coordinate scheduling of the machine dispatching and the product transportation in the integrated system of supply chain is studied. The emphasis is the situation that the workpieces are located in the different storage space during delivery to the customers when the transportation resources are limited with parallel machines in the manufacturing system.We provide a proof of NP-hard and focus on developing heuristic algorithm with the guaranteed worst-case performance for some special cases of the problem. |
| |
| Keywords: | scheduling transportation NP-hard heuristics |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
