Complexity, bounds and dynamic programming algorithms for single track train scheduling

Jonas Harbering (), Abhiram Ranade (), Marie Schmidt () and Oliver Sinnen ()
Additional contact information
Jonas Harbering: Georg-August-University of Göttingen
Abhiram Ranade: Indian Institute of Technology Bombay
Marie Schmidt: Erasmus University Rotterdam
Oliver Sinnen: University of Auckland

Annals of Operations Research, 2019, vol. 273, issue 1, No 17, 479-500

Abstract: Abstract In this work we consider the single track train scheduling problem. The problem consists of scheduling a set of trains from opposite sides along a single track. The track has intermediate stations and the trains are only allowed to pass each other at those stations. Traversal times of the trains on the blocks between the stations only depend on the block lengths but not on the train. This problem is a special case of minimizing the makespan in job shop scheduling with two counter routes and no preemption. We develop a lower bound on the makespan of the train scheduling problem which provides us with an easy solution method in some special cases. Additionally, we prove that for a fixed number of blocks the problem can be solved in pseudo-polynomial time.

Keywords: Machine scheduling; Train scheduling; Complexity analysis; Counter routes (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2644-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:273:y:2019:i:1:d:10.1007_s10479-017-2644-7

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-017-2644-7

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().