D/M/1 Queue: Policies and Control
From MaRDI portal
(Redirected from D/M/1 Queue: Policies and Control)
Elementary classical functions (33B99) Functional-differential equations (including equations with delayed, advanced or state-dependent argument) (34Kxx) Laplace transform (44A10) History of probability theory (60-03) Queueing theory (aspects of probability theory) (60K25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) History of operations research and mathematical programming (90-03) Queues and service in operations research (90B22)
Abstract: Equilibrium G/M/1-FIFO waiting times are exponentially distributed, as first proved by Smith (1953). For other client-sorting policies, such generality is not feasible. Assume that interarrival times are constant. Symbolics for the D/M/1-LIFO density are completely known; numerics for D/M/1-SIRO arise via an unpublished recursion due to Burke (1967). Consider a weighted sum of two costs, one from keeping clients waiting for treatment and the other from having the server idle. With this in mind, what is the optimal interarrival time and how does this depend on the choice of policy?
This page was built for publication: D/M/1 Queue: Policies and Control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6414085)
