Enviar artigo por via de e-mail Two-directional traffic scheduling problem solution for a single-track railway with siding
- Autores: Lazarev A.A.1,2,3,4, Musatova E.G.1, Tarasov I.A.1,2
-
Afiliações:
- Trapeznikov Institute of Control Sciences
- Lomonosov State University
- National Research University Higher School of Economics
- Moscow Physical and Technical Institute (State University)
- Edição: Volume 77, Nº 12 (2016)
- Páginas: 2118-2131
- Seção: Topical Issue
- URL: https://journals.rcsi.science/0005-1179/article/view/150490
- DOI: https://doi.org/10.1134/S0005117916120031
- ID: 150490
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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).
Sobre autores
A. Lazarev
Trapeznikov Institute of Control Sciences; Lomonosov State University; National Research University Higher School of Economics; Moscow Physical and Technical Institute (State University)
Autor responsável pela correspondência
Email: jobmath@mail.ru
Rússia, Moscow; Moscow; Moscow; Dolgoprudnyi
E. Musatova
Trapeznikov Institute of Control Sciences
Email: jobmath@mail.ru
Rússia, Moscow
I. Tarasov
Trapeznikov Institute of Control Sciences; Lomonosov State University
Email: jobmath@mail.ru
Rússia, Moscow; Moscow
Arquivos suplementares
