Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
- 27 April 2017
- journal article
- research article
- Published by Springer Science and Business Media LLC in Journal of Scheduling
- Vol. 21 (2), 191-207
- https://doi.org/10.1007/s10951-017-0526-0
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Modeling Network Transition Constraints with HypergraphsTransportation Science, 2011
- A disjunctive graph model and framework for constructing new train schedulesEuropean Journal of Operational Research, 2010
- A new neighborhood and tabu search for the Blocking Job ShopDiscrete Applied Mathematics, 2009
- Reordering and Local Rerouting Strategies to Manage Train Traffic in Real TimeTransportation Science, 2008
- A branch and bound algorithm for scheduling trains in a railway networkEuropean Journal of Operational Research, 2007
- A multi-objective train scheduling model and solutionTransportation Research Part B: Methodological, 2004
- Scheduling trains on a railway network using a discrete event model of railway trafficTransportation Research Part B: Methodological, 2004
- A Survey of Optimization Models for Train Routing and SchedulingTransportation Science, 1998
- A Model, Algorithms and Strategy for Train PathingJournal of the Operational Research Society, 1995
- A fast heuristic for the train scheduling problemComputers & Operations Research, 1994