Multinedex problem of seminar scheduling

The goal of the paper is to expand the field of applicability of flow algorithms for analyzing multi-index problems in solving one problem of scheduling theory. The paper considers a multi-index statement of seminar scheduling  problem. Two particular cases are considered: the problem with the decomposition matrix of schedule effectiveness and the problem with the efficiency matrix, which reflects the correspondence of audiences to lectures. For the first special case, the possibility of reduction the seminar scheduling problem to network flow problem is shown. For the second one, a heuristic solution algorithm is proposed, and the results of the computational experiment are presented.