提出了生产管理中一类排序问题的数学模型并设计了有效的混合式遗传算法求解程序。
The mathematical mode of a sequencing problem in management system is raised and it is solved successfully by designing the responding HGA computer program.
研究N元集的一类排序问题的最优设计，得到了N元集逆序排序所需的最少抽换次数，同时也给出了相关的结果和算法的实。
The optimal design for a kind of sequencing problem of N-set is investigated, and the least substitution times of the converse ordinal of N-set is obtained.
这是另外一个可以支持排序的对象集合的类，其中每个排序键必须是唯一的。
This is yet another class that supports sorted collection of objects where each sort key must be unique.
应用推荐