The Problem of Scheduling for the Linear Section of a Single-Track Railway with Independent Edges Orientations

Abstract

The paper is devoted to the problem of scheduling for the linear section of a single-track railway: how to organize the ow in both directions in the most efficient way. In this paper, the authors propose an algorithm for scheduling with independent edges orientations, examine the properties of this algorithm and perform the computational experiments.