A disjunctive graph model and framework for constructing new train schedules
From MaRDI portal
Publication:2379528
DOI10.1016/j.ejor.2008.12.005zbMath1187.90129OpenAlexW1998885613MaRDI QIDQ2379528
Erhan Kozan, Robert L. 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
Related Items (14)
A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction ⋮ Optimisation models for expanding a railway's theoretical capacity ⋮ Determining operations affected by delay in predictive train timetables ⋮ Stockpile scheduling with geometry constraints in dry bulk terminals ⋮ An integrated approach for scheduling health care activities in a hospital ⋮ MODELLING AND OPTIMISATION OF RAILWAY CREW SCHEDULING ⋮ Optimising a coal rail network under capacity constraints ⋮ A job-shop scheduling approach for optimising sugarcane rail operations ⋮ A flexible job shop scheduling approach with operators for coal export terminals ⋮ Computational complexity of convoy movement planning problems ⋮ Approaches to modeling train scheduling problems as job-shop problems with blocking constraints ⋮ Modelling railway freight traffic using the methods of graph theory and combinatorial optimization ⋮ Optimal allocation of buffer times to increase train schedule robustness ⋮ A simulated annealing algorithm for first train transfer problem in urban railway networks
Cites Work
- Routing trains through railway stations: Complexity issues
- A fast heuristic for the train scheduling problem
- An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
- Job-shop scheduling with processing alternatives.
- A repairing technique for the local search of the job-shop problem.
- Routing trains through a railway station based on a node packing model
- The permutation flow shop with buffers: A tabu search approach
- Insertion techniques for the heuristic solution of the job shop problem
- Job-shop scheduling with blocking and no-wait constraints
- Effective neighbourhood functions for the flexible job shop problem
- Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches
- Bicriteria train scheduling for high-speed passenger railroad planning applications
- Heuristic techniques for single line train scheduling
- Railway Timetabling Using Lagrangian Relaxation
- A Survey of Optimization Models for Train Routing and Scheduling
- Knowledge-based system for railway scheduling
- Routing Trains Through Railway Stations: Model Formulation and Algorithms
- THE ASSIGNMENT OF INDIVIDUAL RENEWABLE RESOURCES IN SCHEDULING
- Job scheduling with technical constraints
- A Model, Algorithms and Strategy for Train Pathing
This page was built for publication: A disjunctive graph model and framework for constructing new train schedules
