Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules

DOI10.1016/j.mcm.2009.03.011zbMath1185.90067OpenAlexW2046077718MaRDI QIDQ969881

Erhan Kozan, Robert L. Burdett

Publication date: 8 May 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2009.03.011

zbMATH Keywords

job shopmeta-heuristicstrain scheduling

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Determining operations affected by delay in predictive train timetables ⋮ A flexible job shop scheduling approach with operators for coal export terminals ⋮ Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules

Cites Work

• Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules
• A branch and bound algorithm for scheduling trains in a railway network

This page was built for publication: Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules