TIME-BASED TRANSPORTATION PATTERNS AND THEIR ADJUSTMENT FOR RESOURCES PROCESSING TIMETABLE AT POINTS OF DESTINATION
Abstract
Classical minimum-time transportation problem [1, 2, 4] doesn’t assume any supplementary processing of resources at the points of destination. The elementary variant supposes that the processing of each consignment begins immediately after it arrives at the destination. It is a model without process queues.
About the Author
N. M. Nechitaylo
Rostov State University of Railway Engineering, Rostov-on-the-Don
Russian Federation
Russian Federation
Ph.D. (Tech), associate professor at the department of informatics
References
1. Гольштейн Е. Г., Юдин Д. Б. Задачи линейного программирования транспортного типа. – М.: Наука, 1969. – 384 с. Golshtein E. G., Yudin D. B. Problems of linear programming of transport type [Zadachi lineinogo programmirovaniya transportnogo tipa]. Moscow, Nauka publ., 1969. 384 p.
2. Зуховицкий С. И., Авдеева Л. И. Линейное и выпуклое программирование. – 2-е изд., перераб. и доп. – М.: Наука, 1967. – 460 с. Zuhovitsky S. I., Avdeeva L. I. Linear and convex programming [Lineinoe i vypukloe programmirovanie]. Moscow, Nauka publ., 1967. 460 p.
3. Корбут А. А., Финкельштейн Ю. Ю. Дискретное программирование. – М.: Наука, 1969. – 370 с. Korbut A. A., Finkelshtein Yu.Yu. Korbut A. A., Finkelshtein Yu.Yu. Discrete programming [Diskretnoe programmirovanie]. Moscow, Nauka publ., 1969. 370 p.
4. Триус Е. Б. Задачи математического программирования транспортного типа. – М.: Наука, 1967. – 208 с. Trius E. B. Problems of mathematical programming o f transport type [Zadachi matematicheskogo programmirovaniya transportnogo tipa]. Moscow, Nauka publ., 1967. 208 p.
Review
For citations:
Nechitaylo N.M. TIME-BASED TRANSPORTATION PATTERNS AND THEIR ADJUSTMENT FOR RESOURCES PROCESSING TIMETABLE AT POINTS OF DESTINATION. World of Transport and Transportation. 2013;(1):14-19.
Views:
310
Email this article 