We investigate some real time behaviour of a (discrete time) single server system with nonpreemptive LCFS task scheduling. The main results deal with the probability distribution of a random variable \(\operatorname{SRD}(T)\), which describes the time the system operates without any violation of a f
β¦ LIBER β¦
On nonpreemptive strategies in stochastic scheduling
β Scribed by K. D. Glazebrook
- Publisher
- John Wiley and Sons
- Year
- 1981
- Tongue
- English
- Weight
- 554 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On Nonpreemptive LCFS Scheduling with De
β
U. Schmid; J. Blieberger
π
Article
π
1995
π
Elsevier Science
π
English
β 947 KB
Optimal match-up strategies in stochasti
β
John R. Birge; M.A.H. Dempster
π
Article
π
1995
π
Elsevier Science
π
English
β 802 KB
Preemptive versus nonpreemptive scheduli
β
Marek Kubale
π
Article
π
1996
π
Elsevier Science
π
English
β 771 KB
On stochastic dynamic stackelberg strate
β
David Castanon; Michael Athans
π
Article
π
1976
π
Elsevier Science
π
English
β 612 KB
In dynamic two-person games with alternating decision, the feedback Stackelberg solution concept represents an adaptive equilibrium between independent players; this concept applies to a class of stochastic multi-stage games. Summary--Feedback Stackelberg strategies are considered for two-person li
Bicriterion stochastic scheduling on one
β
Frank G. Forst
π
Article
π
1995
π
Elsevier Science
π
English
β 370 KB
Incorporating on-line scheduling strateg
β
A. Huercio; A. EspuΓ±a; L. Puigjaner
π
Article
π
1995
π
Elsevier Science
π
English
β 350 KB