Abstract:
|
In this thesis we attempt to make a probabilistic
analysis of some physically realizable, though complex,
storage and queueing models. It is essentially a mathematical
study of the stochastic processes underlying
these models. Our aim is to have an improved understanding
of the behaviour of such models, that may widen their
applicability. Different inventory systems with randon1
lead times, vacation to the server, bulk demands, varying
ordering levels, etc. are considered. Also we study some
finite and infinite capacity queueing systems with bulk
service and vacation to the server and obtain the transient
solution in certain cases. Each chapter in the thesis is
provided with self introduction and some important references |