| 分装式流水作业加工模型的性质及启发式算法研究 |
| |
| 引用本文： | 吕绪华.分装式流水作业加工模型的性质及启发式算法研究[J].数学理论与应用,2007,27(1):125-128. |
| |
| 作者姓名： | 吕绪华 |
| |
| 作者单位： | 武汉科技大学理学院 武汉4300081 |
| |
| 摘 要： | 分装式流水作业(简记为TMF)加工模型是从生产实践中提炼出的新型的排序模型。由于文献1]2]中已经证明该问题在一般情况下是NP-完全问题,没有多项式时间算法。在这篇论文中进一步讨论了该加工模型的性质,并提出了它的启发式算法以及启发式算法在最坏情况下的性能比的上界。
|
| 关 键 词： | TMF加工模型 NP-完全问题 启发式算法 性能比 |
| 文章编号： | 24259726 |
| 修稿时间： | 10 5 2006 12:00AM |
Study on the property and the Heuristic algorithms of TMF process model |
| |
| Lu Xuhua.Study on the property and the Heuristic algorithms of TMF process model[J].Mathematical Theory and Applications,2007,27(1):125-128. |
| |
| Authors: | Lu Xuhua |
| |
| Institution: | University of Science and Technology,College of Scinece ,Wuhan ,4300081 |
| |
| Abstract: | A type of new process model is studied.Because it is shown to be NP-complete 1],no good polynomial algorithm can be found,in this paper the property and the heuristic algorithms of the process model is presented to find suboptimal solution.and provided that the upper bounds of the performance ratio in the worst case for the heuristic algorithms. |
| |
| Keywords: | TMF process model MP-Complete heuristic algorithm performance ratio |
| 本文献已被 CNKI 维普 等数据库收录！ |
