Dyuthi @ CUSAT >
Ph.D THESES >
Faculty of Sciences >
Please use this identifier to cite or link to this item:
http://purl.org/purl/3451
|
Title: | Stochastic processes and their applications semi-markov analysis of some inventory and queuing problems |
Authors: | Lakshmy, B Dr.Krishnamoorthy,A |
Keywords: | Inventory theory Queing theory Semi-markov and markov renewal Probabilities Model I: G/Ek/1 Queue Model II: M/Gaob/l Queue. |
Issue Date: | Feb-1991 |
Publisher: | Cochin University of Science And Technology |
Abstract: | This thesis analyses certain problems in Inventories
and Queues. There are many situations in real-life where we
encounter models as described in this thesis. It analyses
in depth various models which can be applied to production,
storag¢, telephone traffic, road traffic, economics, business
administration, serving of customers, operations of particle
counters and others. Certain models described here is not a
complete representation of the true situation in all its
complexity, but a simplified version amenable to analysis.
While discussing the models, we show how a dependence structure can be suitably introduced in some problems of Inventories and Queues. Continuous review, single commodity inventory systems with Markov dependence structure introduced in the demand quantities, replenishment quantities and reordering levels are considered separately. Lead time is assumed to be zero in these models. An inventory model involving random lead
time is also considered (Chapter-4). Further finite capacity
single server queueing systems with single/bulk arrival,
single/bulk services are also discussed. In some models the
server is assumed to go on vacation (Chapters 7 and 8). In
chapters 5 and 6 a sort of dependence is introduced in the
service pattern in some queuing models. |
Description: | Department of mathematics & statistics, Cochin University of Science And Technology |
URI: | http://dyuthi.cusat.ac.in/purl/3451 |
Appears in Collections: | Faculty of Sciences
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|