Optimal Service Time Distribution for an <i>M</i>/<i>G</i>/1 Waiting Queue

Suppose that in an <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>M</mi><mo>/</mo><mi>G</mi><mo>/</mo><mn>1</mn></mrow></semantics></math></inline-formula> waiting queue, the server can choose between two service time distributions. We look for...

Full beskrivning

Bibliografiska uppgifter

Huvudupphov:	Mario Lefebvre, Roozbeh Yaghoubi
Materialtyp:	Artigo
Språk:	Inglês
Utgiven:	MDPI AG 2024-08-01
Serie:	Axioms
Ämnen:	M/M/1 model active queue management service rate policy dynamic programming first-passage time homing problem
Länkar:	https://www.mdpi.com/2075-1680/13/9/594
Taggar:	Lägg till en tagg Inga taggar, Lägg till första taggen!