|
Avtomatika i Telemekhanika, 1986, Issue 5, Pages 82–90
(Mi at6270)
|
|
|
|
Developing Systems
Optimal combinations of priority rules for scheduling
A. I. Babushkina, I. S. Belov a Khar'kov
Abstract:
For the problem of finding optimal combinations of priority scheduling rules an optimal algorithm of finding an optimal combination of static priorities in a three-server problem and polynomial algorithms with estimates in the problem of $m$ servers are proposed and some results on choice of a set of static priorities are given. The finding of an optimal combination of dynamic priorities in a weighted problem of one server is found to be a polynomially complete problem.
Received: 12.05.1985
Citation:
A. I. Babushkin, I. S. Belov, “Optimal combinations of priority rules for scheduling”, Avtomat. i Telemekh., 1986, no. 5, 82–90; Autom. Remote Control, 47:5 (1986), 661–668
Linking options:
https://www.mathnet.ru/eng/at6270 https://www.mathnet.ru/eng/at/y1986/i5/p82
|
Statistics & downloads: |
Abstract page: | 130 | Full-text PDF : | 48 |
|