A disjunctive graph model and framework for constructing new train schedules
From MaRDI portal
Publication:2379528
DOI10.1016/J.EJOR.2008.12.005zbMATH Open1187.90129OpenAlexW1998885613MaRDI QIDQ2379528FDOQ2379528
Authors: Erhan Kozan, Robert Burdett 
Publication date: 19 March 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.12.005
Recommendations
- A sequencing approach for creating new train timetables
- A branch and bound algorithm for scheduling trains in a railway network
- On one approach to constructing timetables of freight trains in a railroad network
- Efficient scheduling of traffic on a railway line
- Train scheduling in a large and highly utilised railway network
Cites Work
- Routing Trains Through Railway Stations: Model Formulation and Algorithms
- Railway timetabling using Lagrangian relaxation
- A Model, Algorithms and Strategy for Train Pathing
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Effective neighbourhood functions for the flexible job shop problem
- Bicriteria train scheduling for high-speed passenger railroad planning applications
- A survey of optimization models for train routing and scheduling
- The permutation flow shop with buffers: A tabu search approach
- Job-shop scheduling with blocking and no-wait constraints
- Job-shop scheduling with processing alternatives.
- A fast heuristic for the train scheduling problem
- Routing trains through a railway station based on a node packing model
- Heuristic techniques for single line train scheduling
- Routing trains through railway stations: Complexity issues
- Job scheduling with technical constraints
- Insertion techniques for the heuristic solution of the job shop problem
- Knowledge-based system for railway scheduling
- A repairing technique for the local search of the job-shop problem.
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING
Cited In (16)
- A job-shop scheduling approach for optimising sugarcane rail operations
- A flexible job shop scheduling approach with operators for coal export terminals
- A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction
- Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
- Optimal allocation of buffer times to increase train schedule robustness
- MODELLING AND OPTIMISATION OF RAILWAY CREW SCHEDULING
- Modelling railway freight traffic using the methods of graph theory and combinatorial optimization
- Optimisation models for expanding a railway's theoretical capacity
- Determining operations affected by delay in predictive train timetables
- A disjunctive program formulation to generate regular public transit timetables adhering to prioritized planning requirements
- Stockpile scheduling with geometry constraints in dry bulk terminals
- A simulated annealing algorithm for first train transfer problem in urban railway networks
- Optimising a coal rail network under capacity constraints
- Computational complexity of convoy movement planning problems
- A sequencing approach for creating new train timetables
- An integrated approach for scheduling health care activities in a hospital
This page was built for publication: A disjunctive graph model and framework for constructing new train schedules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379528)
