FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC
From MaRDI portal
Publication:3503068
DOI10.1142/S0217595907001358zbMath1162.90454OpenAlexW2016751795MaRDI QIDQ3503068
Ram Gopalan, T. T. Narendran, T. Godwin
Publication date: 20 May 2008
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595907001358
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Cites Work
- Unnamed Item
- Routing trains through railway stations: Complexity issues
- The train marshalling problem
- Bicriteria train scheduling for high-speed passenger railroad planning applications
- A Survey of Optimization Models for Train Routing and Scheduling
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Complexity of Scheduling Shops with No Wait in Process
- A dual algorithm for the constrained shortest path problem
- The Complexity of Flowshop and Jobshop Scheduling
This page was built for publication: FREIGHT TRAIN ROUTING AND SCHEDULING IN A PASSENGER RAIL NETWORK: COMPUTATIONAL COMPLEXITY AND THE STEPWISE DISPATCHING HEURISTIC
