On one way to estimate the criterion in problems of timetable theory

The paper is concerned with nonconventional statement of the problems of theory of timetable which makes it possible to model previously unfixed technological structures. A method is proposed for computing the lower estimate of the indices (criteria) of the performance of timetables. The method requires approximation of the initial problem by a linear programming model. It is proved that any feasible timetable of this linear problem and the optimum of the linear form is the lower estimate of the timetable performance index. Results of computing experiments are given.