Hostname: page-component-77c89778f8-swr86 Total loading time: 0 Render date: 2024-07-20T13:20:38.791Z Has data issue: false hasContentIssue false
  • English
  • Français

On monotone optimal policies in a queueing model of M/G/1 type with controllable service time distribution

Published online by Cambridge University Press:  01 July 2016

Eckhardt Gallisch
Eckhardt Gallisch*
Affiliation:
Universität Bonn
*
∗Postal address: Institut für Angewandte Mathematik der Universität Bonn, Wegeler Str. 6, D 5300 Bonn 1, West Germany.
Get access Rights & Permissions [Opens in a new window]

Abstract

A queueing model of M/G/1 type with controllable service time distribution is considered in this paper. Conditions on costs and service time distribution only are established such that there exists a monotone policy optimal relative to the average cost criterion. To prove this, it is shown that it suffices to search for a monotone optimal policy in a Markov decision model associated with the queueing model.

Keywords

M/G/1 QUEUEMARKOV DECISION MODELDYNAMIC PROGRAMMING WITH UNBOUNDED REWARDS
Type
Research Article
Information
Advances in Applied Probability , Volume 11 , Issue 4 , December 1979 , pp. 870 - 887
Copyright
Copyright © Applied Probability Trust 1979 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Berge, C. (1963) Topological Spaces. Macmillan, New York.Google Scholar
Chung, K. L. (1967) Markov Chains with Stationary Transition Probabilities. Springer-Verlag, Berlin.Google Scholar
Cohen, J. W. (1969) The Single Server Queue. North-Holland, Amsterdam.Google Scholar
Derman, C. (1970) Finite State Markov Decision Processes. Academic Press, New York.Google Scholar
Lehmann, E. L. (1959) Testing Statistical Hypotheses. Wiley, New York.Google Scholar
Lippman, S. A. (1973) A new technique in the optimization of exponential queueing systems Working paper 211 University of California, Los Angeles.CrossRefGoogle Scholar
Lippman, S. A. (1975) On dynamic programming with unbounded rewards. Management Sci. 21, 1225–1233.CrossRefGoogle Scholar
Mitchell, B. (1973) Optimal service-rate selection in an M/G/1 queue. SIAM J. Appl. Math. 24, 19–35.CrossRefGoogle Scholar
Ross, S. M. (1970a) Applied Probability Models with Optimization Applications. Holden-Day, San Francisco.Google Scholar
Ross, S. M. (1970b) Average cost semi-Markov decision processes. J. Appl. Prob. 7, 649–659.CrossRefGoogle Scholar
Sabeti, H. (1970) Optimal decision in queueing. ORC 70–12, University of California Operations Research Center, Berkeley.CrossRefGoogle Scholar
SchäL, M. (1969) Markoffsche Erneuerungsprozesse mit Hilfspfaden. Dissertation, Hamburg.Google Scholar
SchäL, M. (1970) Markov renewal processes with auxiliary paths. Ann. Math. Statist. 41, 1604–1623.CrossRefGoogle Scholar
Schäl, M. (1971) The analysis of queues with state-dependent parameters by Markov renewal processes. Adv. Appl. Prob. 3, 155–175.CrossRefGoogle Scholar
Schäl, M. (1975) Conditions for optimality in dynamic programming and for the limit of n-stage optimal policies to be optimal. Z. Wahrscheinlichkeitsth. 32, 179–196.CrossRefGoogle Scholar
Schäl, M. (1977) On negative dynamic programming with irreducible Markov chains and the average cost criterion. Bonn. Math. Schr. 98.Google Scholar
Schäl, M. (1978) On the M/G/1-queue with controlled service rate. In Optimization and Operations Research, ed. Henn, R. and Korte, B. Springer-Verlag, Berlin.Google Scholar
Schassberger, R. (1975) A note on optimal service selection in a single server queue. Management Sci. 21, 1326–1331.CrossRefGoogle Scholar
Schellhaas, H. (1977) Semi-regenerative processes with unbounded rewards. Preprint Nr. 343, Technische Hochschule Darmstadt.Google Scholar
Serfozo, R. F. (1976) Monotone optimal policies for Markov decision processes. Math. Programming Study 6, 202–215.CrossRefGoogle Scholar
Sobel, M. J. (1975) The optimality of full-service policies. Lexington Symposium on Stochastic Systems.Google Scholar
Stoyan, D. (1977) Qualitative Eigenschaften und Abschätzungen stochastischer Modelle. Oldenbourg-Verlag, München.CrossRefGoogle Scholar
Tijms, H. (1975) On the optimality of a switch-over policy for controlling the queue size in an M/G/1 queue with variable service rate. Report BW 25/75, Mathematisch Centrum, Amsterdam.Google Scholar
Whitt, W. (1975) Approximation of Dynamic Programs. Yale University Press, New Haven.Google Scholar