Novosibirsk State University Journal of Information Technologies
Scientic Journal

ISSN 2410-0420 (Online), ISSN 1818-7900 (Print)

Switch to
Russian

All Issues >> Contents: Volume 13, Issue No 1 (2015)

Gradient method of making a static schedules for conveyor systems based on greedy strategies
Kirill Viktorovich Krotov

Sevastopol State University

UDC code: 004: 519.854

Abstract
The model of scheduling data in conveyor systems and method of constructing a static schedule, which based on greedy strategy, were found in work.

Key Words
multi-stage conveyor system, schedules performance data processing programs, gradient method, greedy algorithm

How to cite:
Krotov K. V. Gradient method of making a static schedules for conveyor systems based on greedy strategies // Vestnik NSU Series: Information Technologies. - 2015. - Volume 13, Issue No 1. - P. 55–73. - ISSN 1818-7900. (in Russian).

Full Text in Russian

Available in PDF

References
1. K. Hughes. Parallel and Distributed Programming in C ++/ Hughes T. M .: Publishing House “Williamsˮ, 2004. 672 p.
2. Toporkov V. V. Models of distributed computing. Moscow FIZMATLIT, 2004, 320 p.
3. Voevodin V. V., Voevodin Vl.V. Parallel computing. SPb, Publishing house «BHV- Petersburg», 2002. 599 p.
4. Sirotina N. Y. Parallel Computing System. Krasnoyarsk University FSEIHPE «Siberian Federal University», 2008, 133 p.
5. Lazarev A. A., Gafarov E.R. Scheduling theory. Problems and algorithms. Moscow, Publishing House of Moscow State University, 2011. 222 p.
6. Lazarev A. A., Musatov E. G., Kvartsheliya A. G., Gafarov E. R. Scheduling theory. Objectives of traffic management systems. Moscow, Publishing House of Moscow State University, 2012, 159 p.
7. Dolgov O. E., Peresvetov V. V. Scheduling minimizing total tardiness on a single device by parallel ant colony. / Computer science, computer facilities and management. Bulletin PNU, 2012, № 2 (25), p. 45-52.
8. Pinedo M. L. Sheduling.Theory,Algoritms, and Systems. Springer, 2008, 664 p.
9. Kovalev M. M. Models and methods of scheduling. Lectures. Minsk, Publishing house BSU, 2004, 63 p.
10. Kovalev M. M. Matroids in discrete optimization. Moscow, Publishing house «Editorial IRDA», 2003. 224 p.
11. Kormen T., Leiserson C., Rivest R. Algorithms. Construction and analysis. Moscow, MTsNMO, 2002, 960 p. 16.
12. M. H. Prilutsky, V. S.Vlasov. Branch and bound method with heuristic estimates for conveyor scheduling problems. Mathematical modeling. Optimal control. Bulletin of the Nizhny Novgorod University, 2008, №3,. p.147-153.
13. Rutkovskaya D, Rutkowski J., Pilinsky M., Rutkovskiy L. M. Neural networks, genetic algorithms and fuzzy systems. Hotline Telecom, 2006, 284 p.
14. Shapovalov T. S. Genetic algorithm for scheduling run parallel jobs in GRID. Multiprocessor computer systems, 2010, №4 (26), p. 115-126.

Publication information
Main title Vestnik NSU Series: Information Technologies, Volume 13, Issue No 1 (2015).
Parallel title: Novosibirsk State University Journal of Information Technologies Volume 13, Issue No 1 (2015).

Key title: Vestnik Novosibirskogo gosudarstvennogo universiteta. Seriâ: Informacionnye tehnologii
Abbreviated key title: Vestn. Novosib. Gos. Univ., Ser.: Inf. Tehnol.
Variant title: Vestnik NGU. Seriâ: Informacionnye tehnologii

Year of Publication: 2015
ISSN: 1818-7900 (Print), ISSN 2410-0420 (Online)
Publisher: Novosibirsk State University Press
DSpace handle


|Home Page| |All Issues| |Information for Authors| |Journal Boards| |Ethical principles| |Editorial Policy| |Contact Information| |Old Site in Russian|

inftech@vestnik.nsu.ru
© 2006-2017, Novosibirsk State University.