On the Kleinrock-Nilsson problem of optimal scheduling algorithms for time-shared systems (Q1061598)
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: On the Kleinrock-Nilsson problem of optimal scheduling algorithms for time-shared systems |
scientific article; zbMATH DE number 3912079
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Kleinrock-Nilsson problem of optimal scheduling algorithms for time-shared systems |
scientific article; zbMATH DE number 3912079 |
Statements
On the Kleinrock-Nilsson problem of optimal scheduling algorithms for time-shared systems (English)
0 references
1986
0 references
We seek to minimize the mean-squared deviation of a waiting time function from a desired response function over the class of waiting time functions satisfying the Kleinrock-Nilsson necessary conditions. We will characterize analytically the optimal policy as the minimum majorant in the appropriate class of the cumulative ''response to go''. We will show that, in general, the monotonicity necessary condition results in optimal policies which depend in some sense on the future and are anticipating.
0 references
mean-squared deviation
0 references
waiting time function
0 references
optimal policy
0 references
monotonicity necessary condition
0 references
optimal algorithms
0 references
time sharing
0 references
service time
0 references
0.7827696204185486
0 references
0.7775347232818604
0 references
0.7762095928192139
0 references
