MODIFIED ROMANOVSKY ALGORITHM FOR QUICK FINDING OF APPROXIMATE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEM
Abstract
The modification of Romanovsky algorithm for the approximate solution to the homogeneous allocation problem is developed. The modification involves lower resource requirements as against the original algorithm. The changes in the original algorithm which permit to provide a more effective procedure of loading executors with tasks are described. The computational experiments are resulted.
About the Authors
Rudolf A. Neydorf
Don State Technical University
Russian Federation
Russian Federation
Artem A. Zhikulin
Don State Technical University
Russian Federation
Russian Federation
References
1. Koffman, E`. G. Teoriya raspisaniya i vy`chislitel`ny`e mashiny` / E`. G. Koffman. — Moskva: Nauka, 1984. — 334 s. — In Russian.
2. Konvej, R. V. Teoriya raspisanij / R. V. Konvej, V. L. Maksvell, L. V. Miller. — Moskva: Nauka, 1975. — 360 s. — In Russian.
3. Nejdorf, R. A. Metodologicheskie problemy` teorii raspisanij / R. A. Nejdorf, V. G. Kobak // Sistemny`j analiz, upravlenie i obrabotka informacii: 1-j mezhvuz. sb. nauch. st. / DGTU; TTI YuFU. — Rostov-na-Donu, 2007. — S. 101—108. — In Russian.
4. Romanovskij, I. V. Algoritmy` resheniya e`kstremal`ny`x zadach / I. V. Romanovskij. — Moskva: Nauka, 1977. — 352 s. — In Russian.
5. Budilovskij, D. M. Optimizaciya resheniya zadach teorii raspisanij na osnove e`volyucionno-geneticheskoj modeli raspredeleniya zadanij: diss. ... kand. texn. nauk. — Rostov-na-Donu, 2007. — 212 s. — In Russian.
Review
For citations:
Neydorf R.A., Zhikulin A.A. MODIFIED ROMANOVSKY ALGORITHM FOR QUICK FINDING OF APPROXIMATE SOLUTION TO HOMOGENEOUS ALLOCATION PROBLEM. Vestnik of Don State Technical University. 2012;12(6):87-92. (In Russ.)
Views:
358
Email this article 