Two-station single-track railway scheduling problem with trains of equal speed

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. 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.

[1]  Jay B. Ghosh,et al.  Batch scheduling to minimize the weighted number of tardy jobs , 2007, Comput. Ind. Eng..

[2]  Max Klimm,et al.  Bidirectional Scheduling on a Path , 2014 .

[3]  Edward Anderson,et al.  Minimizing flow time on a single machine with job classes and setup times , 1991 .

[4]  Philippe Baptiste,et al.  Ten notes on equal-processing-time scheduling , 2004, 4OR.

[5]  Frits C. R. Spieksma,et al.  The lockmasters' problem , 2011 .

[6]  Peter Brucker,et al.  Scheduling railway traffic at a construction site , 2002 .

[7]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[8]  Frits C. R. Spieksma,et al.  The Lockmaster's Problem , 2011, Eur. J. Oper. Res..

[9]  Clyde L. Monma,et al.  On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..

[10]  Elias Silva Oliveira.  Solving Single-Track Railway Scheduling Problem Using Constraint Programming , 2001 .

[11]  Erhan Kozan,et al.  Optimal scheduling of trains on a single line track , 1996 .

[12]  Alexander A. Lazarev,et al.  Two station single track railway scheduling problem with equal speed of trains , 2012 .

[13]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[14]  Shi-Sheng Li,et al.  Single-machine parallel-batching scheduling with family jobs to minimize weighted number of tardy jobs , 2014, Comput. Ind. Eng..

[15]  Yuri N. Sotskov,et al.  Shifting bottleneck algorithm for train scheduling in a single-track railway , 2012 .

[16]  D. Atkin.  OR scheduling algorithms. , 2000, Anesthesiology.

[17]  Matthew E. H. Petering,et al.  Mixed integer programming for minimizing the period of a cyclic railway timetable for a single track with two train types , 2013, Comput. Ind. Eng..

[18]  Kenneth R. Baker.  Heuristic procedures for scheduling job families with setups and due dates , 1999 .

[19]  Mostafa Hajiaghaei-Keshteli,et al.  Integrated scheduling of production and rail transportation , 2014, Comput. Ind. Eng..

[20]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[21]  Frank Werner,et al.  Parallel machine problems with equal processing times: a survey , 2011, J. Sched..

[22]  Alexander A. Lazarev,et al.  Solution algorithms for the two-station single track railway scheduling problem , 2012 .