| 求解AFS问题的两种启发式算法在最坏情况下性能比上界的可达性研究 |
| |
| 引用本文： | 吕绪华,潘开灵. 求解AFS问题的两种启发式算法在最坏情况下性能比上界的可达性研究[J]. 武汉科技大学学报(自然科学版), 1999, 0(3) |
| |
| 作者姓名： | 吕绪华 潘开灵 |
| |
| 作者单位： | 武汉科技大学理学院!武汉，430081(吕绪华)，武汉科技大学管理学院!武汉，430081(潘开灵) |
| |
| 摘 要： | 对文献[2]中提出的求AFS问题的次优解的两个简单易行的启发式算法及其品性进行了进一步的研究。由于已证明了其在最坏情况下性能比Cmax（H）／Cmax的上界不去超过2，本文用两个典型的例子证明：对这两种算法，这一上界是可达的。
|
| 关 键 词： | 排序 装配式流水作业 启发式算法 性能比 |
Achievability of Upper Bound of Performance Ratio on Two Heuristic Algorithms for AFS Scheduling Problem |
| |
| LU Xu-hua,. Achievability of Upper Bound of Performance Ratio on Two Heuristic Algorithms for AFS Scheduling Problem[J]. Journal of Wuhan University of Science and Technology(Natural Science Edition), 1999, 0(3) |
| |
| Authors: | LU Xu-hua |
| |
| Abstract: | The heuristic algorithms and their performance ratios introduced in the references [2] arefurther studied here. It is proved that the upper bounds of the performance ratio in the worst case forheuristic algorithms are not greater than 2. In this paper the authors show in two examples that upperbounds are achievable for these types of algorithm. |
| |
| Keywords: | scheduling assembly flow shop heuristic algorithm performance ratio |
| 本文献已被 CNKI 等数据库收录！ |
