Abstract
In this paper we determine and compare the optimal capacity (K) of a GI/G/1/K queuing system under social and individual optimization.
It is shown by simulation that irrespective of the traffic intensity, p, and arrival and service time distributions, the K obtained from social optimization of the system is always equal to or less than the K obtained from its individual optimization.
Keywords
Get full access to this article
View all access options for this article.
References
1.
Fishman, G.S.
1978 . Principles of Discrete Event Simulation
New York : John Wiley & Sons.
2.
Gross, D.
and
Harris, C.M.
1985 . Fundamentals of Queueing Theory
New York : John Wiley & Sons.
3.
Heyman,D.P.
and
Sobel, M.J.
1982 . Stochastic Models in Operations Research vol. 1. New York : McGraw-Hill.
4.
Law, A.M.
and
Kelton, W.D.
1991 . Simulation Modeling and Analysis
New York : McGraw-Hill.
5.
Pidd, M.
1986 . Computer Simulation in Management Science
New York : John Wiley & Sons.
6.
Rue, R.C.
and
Rosenshine, M.
1981 . "Some properties of optimal control policies for entries to an M/M/1 queue."
Nav. Res. Log. Quart.
28 , pp. 225 -232 .
7.
Sargent, R.G.
1983 . "Validating simulation models."
Proceedings of the 1983 Winter Simulation Conference.
Syracuse, NY: Syracuse University.
8.
Shannon, R.E.
1975 . Systems Simulation: The Art and Science
Englewood, NJ : Prentice-Hall.
9.
Stidham, S. Jr.
1982 . "Optimal control of arrivals to queues and network of queues."
21st IEEE Conference on Decision Control