×
Alidrisi, Mustafa M.

Optimal control of the service rate of an exponential queueing network using Markov decision theory. (English) Zbl 0729.90041

Int. J. Syst. Sci. 21, No. 12, 2553-2563 (1990).
The author considers a queueing system with Poisson input and exponential service at two service stations with finite waiting room. A customer is served only at one station or at the two stations with specified probabilities. The author evaluates a decision rule for the service rate at each station that minimizes a given objective cost function. The problem is formulated as a semi-Markov decision process.
Reviewer: W.Schlee-Kössler (Baldham)

Cited in 3 Documents

MSC:

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

Keywords:

queueing system; Poisson input; exponential service; two service stations; finite waiting room; semi-Markov decision process
Cite Review PDF
Full Text: DOI

References:

[1] DOI: 10.1080/00207728708964033 · Zbl 0612.90039 · doi:10.1080/00207728708964033
[2] DOI: 10.1287/mnsc.18.9.560 · Zbl 0244.60064 · doi:10.1287/mnsc.18.9.560
[3] DOI: 10.1287/opre.25.2.219 · Zbl 0372.60143 · doi:10.1287/opre.25.2.219
[4] DOI: 10.1016/0377-2217(85)90160-2 · Zbl 0569.60091 · doi:10.1016/0377-2217(85)90160-2
[5] GROSS , D. , and HARRIS , C. M. , 1985 ,Fundamentals of Queueing Theory( New York : Wiley ) pp. 361 – 375 . · Zbl 0658.60122
[6] HOWARD R. A., Dynamic Programming and Markov Processes (1960) · Zbl 0091.16001
[7] DOI: 10.1287/opre.5.4.518 · doi:10.1287/opre.5.4.518
[8] DOI: 10.2307/1426752 · Zbl 0436.60074 · doi:10.2307/1426752
[9] DOI: 10.2307/1426622 · Zbl 0512.60087 · doi:10.2307/1426622
[10] DOI: 10.2307/1426467 · Zbl 0446.60062 · doi:10.2307/1426467
[11] SOBEL M., Mathematical Methods in Queueing Theory pp 231– (1974)
[12] STIDHAM , S. , 1985 , Computing Optimal Control Policies for queueing systems . Proc.24th Conf. on Decision and Control , Fort Lauderdale. Fla; 1986, Scheduling, routing and flow control in stochastic networks. Technical Report No. UNC|ORSA|TR-86|22 , University of North Carolina at Chapel Hill , N.C.
[13] STIDHAM S., Mathematical Methods in Queueing theory pp 263– (1974)
[14] WEBER R., Appl. Probab. (1987)
[15] DOI: 10.2307/3213271 · Zbl 0357.60023 · doi:10.2307/3213271
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.