RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 2016 Issue 11, Pages 158–174 (Mi at14603)

This article is cited in 7 papers

Topical issue

Two-directional traffic scheduling problem solution for a single-track railway with siding

A. A. Lazarevabcd, E. G. Musatovaa, I. A. Tarasovab

a Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
b Lomonosov State University, Moscow, Russia
c National Research University Higher School of Economics, Moscow, Russia
d Moscow Physical and Technical Institute (State University), Dolgoprudnyi, Russia

Abstract: The paper is concerned with scheduling trains moving in both directions between two stations connected by a single-track railway with a siding. The paper presents dynamic programming based algorithms which minimizes two objective functions: maximum lateness and total weighted completion time. The complexity of these algorithms is $O(n^2)$.

Presented by the member of Editorial Board: A. I. Kibzun

Received: 04.02.2016


 English version:
Automation and Remote Control, 2016, 77:12, 2118–2131

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025