![]() |
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
The following scheduling problem is considered. There is a double-track railway system with tree-like topology. It is assumed that the schedule of passenger trains and the repairs-and-maintenance plan are known. Our goal is to construct the optimal schedule for cars and freight trains according to the Lmax criterion. Both the problem of long-term planning and that of operational planning are considered. We use the DPA algorithm to construct the optimal and the approximate solutions.