![]() |
ИСТИНА |
Войти в систему Регистрация |
ИПМех РАН |
||
We consider the following railway scheduling problem. There are two stations connected bya double-track railway and a cyclic train timetable is given for movement on the road. Some segments of this road are closed (in one direction) for repair works during some time periods. It is necessary to construct the new schedule for train movement between stations which is the closest to the initial one by the value of the total completion time. We propose a special polynomial algorithm based on dynamic programming to solve this problem.