Scheduling the Two-Way Traffic on a Single-Track Railway with a Siding

被引：0

作者：

Y. Zinder

A. A. Lazarev

E. G. Musatova

I. A. Tarasov

机构：

[1] Technical University of Sydney,

[2] Trapeznikov Institute of Control Sciences,undefined

[3] Russian Academy of Sciences,undefined

[4] Lomonosov State University,undefined

[5] National Research University Higher School of Economics,undefined

[6] Moscow Institute of Physics and Technology (State University),undefined

来源：

Automation and Remote Control | 2018年 / 79卷

关键词：

dynamic programming; polynomial algorithm; railway planning; scheduling theory;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The paper is concerned with scheduling the two-way traffic between two stations connected by a single-track railway with a siding. It is shown that if, for each station, the order in which trains leave this station is known or can be found, then for various objective functions an optimal schedule can be constructed in polynomial time using the method of dynamic programming. Based on this result, the paper also presents a polynomial-time algorithm minimising the weighted number of late trains.

引用

页码：506 / 523

页数：17