Stability polyhedra of optimal permutation of jobs servicing polyhedron (parallelepiped) of the optimality of
permutation of servicing of n jobs that is contained
A Robinson characterization of finite PσT-groups is said to be σ-full if G has a Hall σi-subgroup for all i. A subgroup A of G is said to be
σ-
permutable Minimizing total weighted completion time with uncertain data: a stability approach with an uncertain input data, it is reasonable to consider a minimal dominant set of job
permutations containing
Использование ортогональных массивов при проверке качества программного обеспечения of the input data and the large number of
permutations. The
method allows checking pairwise combination
Критерий σ -разрешимости конечной группы exactly one Hall σᵢ -subgroup of G for every σᵢ∊σ(G). A subgroup A of G is said to be: σ -
permutable in G
On Normal Closures of Involutions in the Group of Limited PermutationsWe study the group G = Lim(N) of limited
permutations of a set N of all natural numbers. Found
О сверхразрешимом корадикале взаимно перестановочных подгруппWe prove that if a group GAB is the mutually
permutable product of the supersoluble subgroups