【摘要】 介绍了机械手抓取排序问题(MSP)并描述了其运行过程,建立了MSP的网络模型并给出了求解方法“η72算法”.通过对“η72算法”的讨论、证明及实例研究表明,应用该算法求解MSP可较好地提高计算效率,并具有性能比为2的优良性质.更多还原

【Abstract】 Manipulator- snatching scheduling problem is introduced and its operating process is described. Network model for MSP is set and the solution named η2 arithmetic is presented. By discussing, proving and example analyzing, it makes clear that the η2 arithmetic will enhance efficiency of computing better and have character that its ratio of performance is 2.更多还原