Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal allocation of a server between two queues with due times

From MaRDI portal
Publication:3986808
Jump to:navigation, search

DOI10.1109/9.106157zbMath0739.60083OpenAlexW2145478322MaRDI QIDQ3986808

Anthony Ephremides, Partha Pratim Bhattacharya

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 programmingqueuesstochastic dominancedynamic priority assignmentstationary optimal preemptive policy


Mathematics Subject Classification ID

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


Related Items (1)

SCHEDULING IMPATIENT JOBS IN A CLEARING SYSTEM WITH INSIGHTS ON PATIENT TRIAGE IN MASS CASUALTY INCIDENTS







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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3986808&oldid=12038544"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 29 January 2024, at 23:58.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki