A sequencing approach for creating new train timetables
From MaRDI portal
Publication:2267382
DOI10.1007/s00291-008-0143-6zbMath1181.90112MaRDI QIDQ2267382
Erhan Kozan, Robert L. Burdett
Publication date: 1 March 2010
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-008-0143-6
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
An integrated approach for earthwork allocation, sequencing and routing, Optimisation models for expanding a railway's theoretical capacity, Determining operations affected by delay in predictive train timetables, A job-shop scheduling approach for optimising sugarcane rail operations, An integrated approach for scheduling health care activities in a hospital, A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain
Cites Work
- Feasible insertions in job shop scheduling, short cycles and stable sets
- The scheduling problem where multiple machines compete for a common local buffer
- Routing trains through railway stations: Complexity issues
- Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment
- 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 symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling.
- A repairing technique for the local search of the job-shop problem.
- An efficient genetic algorithm for job shop scheduling with tardiness objectives.
- 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
- Two simulated annealing-based heuristics for the job shop scheduling problem
- Some new results on simulated annealing applied to the job shop scheduling 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
- Heuristic techniques for single line train scheduling
- Railway Timetabling Using Lagrangian Relaxation
- A Survey of Optimization Models for Train Routing and Scheduling
- Job Shop Scheduling by Simulated Annealing
- Knowledge-based system for railway scheduling
- A genetic algorithm based procedure for more realistic job shop scheduling problems
- 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
