Two-directional traffic scheduling problem solution for a single-track railway with siding


Дәйексөз келтіру

Толық мәтін

Ашық рұқсат Ашық рұқсат
Рұқсат жабық Рұқсат берілді
Рұқсат жабық Тек жазылушылар үшін

Аннотация

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

Қосымша файлдар

Қосымша файлдар
Әрекет
1. JATS XML

© Pleiades Publishing, Ltd., 2016