文章基本信息

标题：Two-Station Single Track Scheduling Problem * * The work was supported by grants: RFBR 13-01-12108, 15-07-07489, 15-07-03141, DAAD A/14/00328.
本地全文：下载
作者：Yakov Zinder ; Alexander A. Lazarev ; Elena G. Musatova 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2016
卷号：49
期号：12
页码：231-236
DOI：10.1016/j.ifacol.2016.07.604
语种：English
出版社：Elsevier
摘要：Single track segments are common in various railway networks, in particular in various supply chains. For such a segment, connecting two stations, the trains form two groups, depending on what station is the initial station for the journey between these two stations. Within a group the trains differ by their cost functions. It is assumed that the single track is sufficiently long so several trains can travel in the same direction simultaneously. The paper presents polynomial-time algorithms for different versions of this two-station train scheduling problem with a single railway track. The considered models differ from each other by their objective functions.
关键词：Operations ResearchTransportation scienceSupply chains and networks