A branch and bound algorithm for scheduling trains in a railway network
Top Cited Papers
- 1 December 2007
- journal article
- Published by Elsevier BV in European Journal of Operational Research
- Vol. 183 (2), 643-657
- https://doi.org/10.1016/j.ejor.2006.10.034
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- An exact solution procedure to determine the optimal dispatching times for complex rail networksIIE Transactions, 2006
- Scheduling trains on a railway network using a discrete event model of railway trafficTransportation Research Part B: Methodological, 2004
- Modeling and Solving the Train Timetabling ProblemOperations Research, 2002
- A fuzzy knowledge-based system for railway traffic controlEngineering Applications of Artificial Intelligence, 2000
- On-line timetable re-scheduling in regional train servicesTransportation Research Part B: Methodological, 1999
- A Survey of Optimization Models for Train Routing and SchedulingTransportation Science, 1998
- Railway Timetabling Using Lagrangian RelaxationTransportation Science, 1998
- Adjustment of heads and tails for the job-shop problemEuropean Journal of Operational Research, 1994
- An Algorithm for Solving the Job-Shop ProblemManagement Science, 1989
- The one-machine sequencing problemEuropean Journal of Operational Research, 1982