In this paper, we consider a two-machine job shop scheduling problem of minimizing total completion time subject to n jobs with one equal-length operation per job on each machine. This problem occurs e.g. as a single-track railway scheduling with three stations and constant travel times between any two adjacent stations. We present a polynomial dynamic programming algorithm of complexity O(n^5) and a heuristic procedure of the complexity O(n^3). We also present computational results of the comparison of both algorithms.