Criterion existence of regular arrangement set of twin symbolic words in matrix size $L\times(2k+1)$

D. M. Alekberli

Управление информационно-аналитического обеспечения при Министерстве экономики Республики Дагестан

Abstract: A particular case of problem called scheduling was considered in this article. This case comes to finding conditions of arrangement twin symbolic words ($2$-words) in rows of matrix $M(L\times(2k+1))$, $k\in N$ so that symbols in rows could stay close, and all symbols in columns of matrix could be different in pairs. Criterion of regular arrangement twin symbolic words in matrix M was found. This criterion allows to ensure the absence of windows in the work of teachers.

Keywords: regular schedule, scheduling, optimization of the schedule, NP-complete problems, problems is solved in polynomial time, criterion for the existence of a regular schedule.