电邮这篇文章 Two-directional traffic scheduling problem solution for a single-track railway with siding
- 作者: Lazarev A.A.1,2,3,4, Musatova E.G.1, Tarasov I.A.1,2
-
隶属关系:
- Trapeznikov Institute of Control Sciences
- Lomonosov State University
- National Research University Higher School of Economics
- Moscow Physical and Technical Institute (State University)
- 期: 卷 77, 编号 12 (2016)
- 页面: 2118-2131
- 栏目: Topical Issue
- URL: https://journals.rcsi.science/0005-1179/article/view/150490
- DOI: https://doi.org/10.1134/S0005117916120031
- ID: 150490
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
The paper is concerned with scheduling trains moving in both directions between two stations connected by a single-track railway with a siding. The paper presents dynamic programming based algorithms which minimizes two objective functions: maximum lateness and total weighted completion time. The complexity of these algorithms is O(n2).
作者简介
A. Lazarev
Trapeznikov Institute of Control Sciences; Lomonosov State University; National Research University Higher School of Economics; Moscow Physical and Technical Institute (State University)
编辑信件的主要联系方式.
Email: jobmath@mail.ru
俄罗斯联邦, Moscow; Moscow; Moscow; Dolgoprudnyi
E. Musatova
Trapeznikov Institute of Control Sciences
Email: jobmath@mail.ru
俄罗斯联邦, Moscow
I. Tarasov
Trapeznikov Institute of Control Sciences; Lomonosov State University
Email: jobmath@mail.ru
俄罗斯联邦, Moscow; Moscow
补充文件
