1) ∨-shaped sequence
∨型排序
2) scheduling model
排序模型
1.
According to the property of triangular fuzzy number,a tabu search(TS) algorithm about the scheduling model nondeter ministic polynomial hard (NP-hard) of 1fuzzymin∑ni=1C_i was constructed under the condition of restricted makespan fuzzy extent.
根据三角形模糊数的特性,在对总加工时间模糊度有约束的条件下,构造出NP-困难的1 fuzzy min∑ni=1Ci排序模型的禁忌搜索(TS)算法。
2.
According to the property of triangular fuzzy number,a genetic algorithm and a scheduling model NP-hard of 1fuzzymin∑ni=1Ci were constructed under the condition of total processing time with restricted span fuzzy extent.
根据三角形模糊数的特性,在对总加工时间模糊度有约束的条件下,构造出NP-困难的1 fuzzy m in∑i=1Ci排序模型的遗传算法。
3) V sequencing
V型排序
4) Λ-shaped sequence
Λ型排序
5) Ⅴ-shaped sequence
Ⅴ型排序
6) ∧-shaped sequence
∧型排序
补充资料：∨
∨ 逻辑或或并运算 若 a 或 b（或都）为真，则命题 a ∨ b 为真；若两者都假则命题为假。 n ≥ 4 ∨ n ≤ 2 ⇔ n ≠ 3，当 n 是自然数
或
命题逻辑，格理论
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条