Most scheduling problems are NP-hard in a strong sense. However for many of them there are polynomial solvable cases. This research shows a metric approach for the problem of planning a single-track railway with two stations. This approach allows us to construct solutions with guaranteed accuracy in polynomial time using special cases of the original NP-hard problem.