Two-station single-track railway scheduling problem with trains of equal speed. (July 2015)

• Record Type: Journal Article
• Authors: Gafarov, Evgeny R.; Dolgui, Alexandre; Lazarev, Alexander A.
• Is Part Of: Computers & industrial engineering. Volume 85(2015)
• Page Start: 260
• Page End: 267
• Publication Date: 2015-07
• Subjects: 90B35; Single machine scheduling -- Setup times -- Transportation -- Train scheduling -- Computational complexity -- Polynomial time algorithms; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2015.03.014
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: A single track railway scheduling for 2 stations and several segments is considered. Often this situation concerns the case of maintenance of one track of a double track line. A reduction to the single machine scheduling problems with setup-times is presented. Polynomial time solution algorithms were developed. Can serve as a basis to develop efficient algorithms for decision support systems. Abstract: In this paper, the single-track railway scheduling problem with two stations and several segments of the track is considered. Two subsets of trains are given, where trains from the first subset go from the first station to the second station, and trains from the second subset go in the opposite direction. The speed of trains over each segment is the same. A polynomial time reduction from the problem under consideration to a special case of the single-machine equal-processing-time scheduling problem with setup times is presented. Different polynomial time algorithms are developed for special cases with divers objective functions under various constraints. Moreover, several theoretical results which can be ranked in a series of similar investigations of NP-hardness of equal-processing-time single-machine scheduling problems without precedence relations are obtained.