| dc.contributor.author |
Deepthi, C P |
|
| dc.contributor.author |
Dr.Krishnamoorthy,A |
|
| dc.date.accessioned |
2014-01-17T07:02:56Z |
|
| dc.date.available |
2014-01-17T07:02:56Z |
|
| dc.date.issued |
2013-05-03 |
|
| dc.identifier.uri |
http://dyuthi.cusat.ac.in/purl/3210 |
|
| dc.description |
Department
of Mathematics, Cochin University of Science and Technology |
en_US |
| dc.description.abstract |
In everyday life different flows of customers to avail some service facility or other at some service station are experienced. In some of these situations, congestion of items arriving for service, because an item cannot be serviced Immediately on arrival, is unavoidable. A queuing system can be described as customers arriving for service, waiting for service if it is not immediate, and if having waited for service, leaving the system after being served. Examples Include shoppers waiting in front of checkout stands in a supermarket, Programs waiting to be processed by a digital computer, ships in the harbor Waiting to be unloaded, persons waiting at railway booking office etc. A queuing system is specified completely by the following characteristics: input or arrival pattern, service pattern, number of service channels, System capacity, queue discipline and number of service stages. The ultimate objective of solving queuing models is to determine the characteristics that measure the performance of the system |
en_US |
| dc.description.sponsorship |
Cochin University of Science and Technology |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
Cochin University of Science and Technology |
en_US |
| dc.subject |
Time inventory models |
en_US |
| dc.subject |
Inventory systems |
en_US |
| dc.subject |
Matrix Analytic Methods |
en_US |
| dc.subject |
Discrete time inventory models |
en_US |
| dc.title |
Discrete Time Inventory Models with/without Positive Service Time |
en_US |
| dc.type |
Thesis |
en_US |