Providing punctual, reliable and performant services to customers is one main goal of railway network operators. The railway scheduling problem is to determine, ahead of time (timetabling), a plan describing the timing of the operations in a railway network, or updating such plan during operations (rescheduling). By optimization and automation, it is possible to operate more trains on the network, closer to the infrastructure capacity. Especially when the scale and complexity of the scheduling problem is increasing, for large-scale networks and multiple interconnected problems, this is of great value for network operators. When planning or adjusting railway operations becomes increasingly complex, modern scheduling algorithms can bring significant performance and economic benefits. In this survey we review approaches in the state of the art for the problems of railway scheduling. We show how the many different approaches of decomposition proposed in the literature of railway scheduling can be categorized into two general principles. We study different solution methods and identify a list of open topics for dealing with large-scale problems for future research.

为客户提供准时、可靠和高效的服务是铁路网络运营商的主要目标之一。铁路调度问题是提前确定（时间表）描述铁路网络运营时间的计划，或在运营期间更新此类计划（重新调度）。通过优化和自动化，可以在网络上运行更多列车，更接近基础设施容量。特别是当调度问题的规模和复杂性不断增加时，对于大规模网络和多个相互关联的问题，这对网络运营商来说具有很大的价值。当规划或调整铁路运营变得越来越复杂时，现代调度算法可以带来显着的性能和经济效益。在本次调查中，我们回顾了解决铁路调度问题的最新方法。我们展示了铁路调度文献中提出的许多不同的分解方法如何可以分为两个一般原则。我们研究了不同的解决方法，并确定了一系列用于处理未来研究的大规模问题的开放主题。