Optimal allocation of a server between two queues with due times

DOI10.1109/9.106157MaRDI QIDQ3986808zbMATH OpenOpenAlexFDO

Authors Partha Pratim Bhattacharya, Anthony Ephremides

Publication date 27 June 1992

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

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

zbMATH Keywords

dynamic priority assignmentdynamic programmingqueuesstationary optimal preemptive policystochastic dominance

Mathematics Subject Classification ID

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

Recommendations

• Optimal assignment policy of a single server attended by two queues
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• Optimal server scheduling in nonpreemptive finite-population queueing systems
• Managing Queues with Heterogeneous Servers
• On the Optimal Control of Two Queues with Server Setup Times and Its Analysis

Cited in

(7)

• Cost optimizing parameters in delay dependent queues with two priority groups
• Attention allocation for decision making queues
• SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS
• Optimal service assignment in a finite-source queue
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• Optimal Allocation of Two Fixed Service Units Acting as M/G/1 Queues
• Server allocation and routing in homogeneous queues with switching penalties

This page was built for publication: Optimal allocation of a server between two queues with due times

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