Optimal priority assignment with hard constraint

DOI10.1109/TAC.1986.1104127MaRDI QIDQ3028695zbMATH OpenOpenAlexFDO

Authors Philippe Nain, Keith W. Ross

Publication date 1986

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.1986.1104127

zbMATH Keywords

discrete-time queueing systemequilibrium behaviourinfinite capacity queueoptimal bias factorrandomized modificationstatic-priority policy

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• A priority based assignment problem
• Optimal priority assignment: a time sharing approach
• Optimal combinations of priority scheduling rules
• Allocation with weak priorities and general constraints
• Efficient assignment respecting priorities
• Minimax resource allocation problems with ordering constraints
• On two competing mechanisms for priority-based allocation problems
• scientific article; zbMATH DE number 2112451
• The object allocation problem with random priorities
• The assignment problem with seniority and job priority constraints

Cited in

(20)

• Boundary value problems in queueing theory
• Recent results on conditions for the existence of average optimal stationary policies
• Optimal control of variable rate coding with incomplete observation in integrated voice/data packet networks
• Sensitivity of constrained Markov decision processes
• Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space
• Integrated optimization of the use of information and hardware resources in data processing systems with controllable message size
• Optimal intensity control of a multi-class queue
• Stochastic approximations for finite-state Markov chains
• Optimization of Priority Class Queues, with a Computer Center Case Study
• Solution to the optimality equation in a class of Markov decision chains with the average cost criterion
• Optimal priority assignment: a time sharing approach
• scientific article; zbMATH DE number 3956782 (Why is no real title available?)
• scientific article; zbMATH DE number 4008076 (Why is no real title available?)
• Technical Note—On Rothkopf and Smith's Statement Regarding Optimal Priority Assignment
• Constrained Semi-Markov decision processes with average rewards
• Optimization in a class of priority-discarding policies for finite queues
• An asymptotically optimal heuristic for general nonstationary finite-horizon restless multi-armed, multi-action bandits
• Asymptotic properties of constrained Markov Decision Processes
• Priority Assignment in Waiting Line Problems
• A Dynamic Programming Model For Assigning Customers To Priority Service Classes

This page was built for publication: Optimal priority assignment with hard constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3028695)