Optimal combinations of priority scheduling rules (Q1819702)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal combinations of priority scheduling rules |
scientific article; zbMATH DE number 3993284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal combinations of priority scheduling rules |
scientific article; zbMATH DE number 3993284 |
Statements
Optimal combinations of priority scheduling rules (English)
0 references
1986
0 references
We consider the problem of optimal combinations of priority scheduling rules. A polynomial algorithm is proposed for finding an optimal combination of static priorities in the three-machine problem, polynomial algorithms with a bound are given for the m-machine problem, and some results concerning the choice of the set of static priorities are presented. It is shown that finding an optimal combination of dynamic priorities in a weighted one-machine problem is a polynomially complete problem.
0 references
optimal combinations of priority scheduling
0 references
polynomial algorithm
0 references
0.8025307655334473
0 references
0.789209246635437
0 references
0.7842335104942322
0 references
0.7747112512588501
0 references
