There is a bit difficult in judging covering assembly in partially ordered relation on a basis of its definition in discrete mathematic.
直接根据现有离散数学教材中偏序关系中“盖住”的定义，来判定偏序关系中的盖住集，有时比较困难。
That can become decomposition partially ordered set into totally ordered subset by analyzing the characteristics of partially ordered relation construction on partially ordered set.
通过分析运用调机时区集合上的偏序结构特点，可以知道使用调机问题的实质是偏序集合的全序分解问题。
That can become decomposition partially ordered set into totally ordered subset by analyzing the characteristics of partially ordered relation construction on partially ordered set.
通过分析运用调机时区集合上的偏序结构特点，可以知道使用调机问题的实质是偏序集合的全序分解问题。
应用推荐