39555

Автор(ы): 

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Статья в журнале/сборнике

Название: 

Minimizing the Maximal Weighted Lateness of Delivering Orders between Two Railroad Stations

ISBN/ISSN: 

0005-1179

DOI: 

10.1134/S0005117916120018

Наименование источника: 

  • Automation and Remote Control

Обозначение и номер тома: 

Vol. 77, No. 12

Город: 

  • Москва

Издательство: 

  • Издательство "Наука"

Год издания: 

2016

Страницы: 

2091–2109
Аннотация
We consider the planning problem for freight transportation between two railroad stations. We are required to fulfill orders (transport cars by trains) that arrive at arbitrary time moments and have different value (weight). The speed of trains moving between stations may be different. We consider problem settings with both fixed and undefined departure times for the trains. For the problem with fixed train departure times we propose an algorithm for minimizing the weighted lateness of orders with time complexity O(qn2 log n) operations, where q is the number of trains and n is the number of orders. For the problem with undefined train departure and arrival times we construct a Pareto optimal set of schedules optimal with respect to criteria wLmax and Cmax in O(n2 max{n log n, q log v}) operations, where v is the number of time windows during which the trains can depart. The proposed algorithm allows to minimize both weighted lateness wLmax and total time of fulfilling freight delivery orders Cmax.

Библиографическая ссылка: 

Архипов Д.И., Лазарев А.А. Minimizing the Maximal Weighted Lateness of Delivering Orders between Two Railroad Stations // Automation and Remote Control. 2016. Vol. 77, No. 12. С. 2091–2109.

Публикация имеет версию на другом языке: 

Да

Связь с публикацией: