• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта

Статья

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

Automation and Remote Control. 2016. Vol. 77. No. 12. P. 2118-2131.
Lazarev A. A., Musatova E., Tarasov I.

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).