Optimal Resource Allocation for Two Processes*
- 1 January 1985
- journal article
- website
- Published by Institute of Electrical and Electronics Engineers (IEEE) in AT&T Technical Journal
- Vol. 64 (1) , 1-14
- https://doi.org/10.1002/j.1538-7305.1985.tb00417.x
Abstract
Two processes compete for access to n resources. A scheduling policy allocates the resource when the processes request it simultaneously. The objective is to minimize the average value of a state-dependent cost. The optimal policy can be calculated explicitly for the case of one resource. In the general case n < 1, an adaptive scheduling algorithm is proposed. The algorithm measures average transition times of the system and converges to the optimal policy.Keywords
This publication has 10 references indexed in Scilit:
- Dominant Strategies in Stochastic Allocation and Scheduling ProblemsPublished by Springer Nature ,1982
- Adaptive control of Markov chains, I: Finite parameter setIEEE Transactions on Automatic Control, 1979
- Optimal Repair of a Series SystemOperations Research, 1978
- Optimal and suboptimal stationary controls for Markov chainsIEEE Transactions on Automatic Control, 1978
- On optimal right-of-way policies at a single-server station when insertion of idle times is permittedStochastic Processes and their Applications, 1977
- Multiple feedback at a single-server stationStochastic Processes and their Applications, 1977
- Time-Sharing Service Systems. ITheory of Probability and Its Applications, 1975
- Dynamic Scheduling of a Multiclass Queue: Discount OptimalityOperations Research, 1975
- A Priority Queue with Discounted Linear CostsOperations Research, 1975
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time DisciplineOperations Research, 1968