Transient Behavior of a Markovian N-Policy Queue with Balking Re-Service and Closedown Time
The objective of this paper is to investigate the non-stationary behavior of an M/M/1 queue with N- policy, re-service, balking and closedown time. The server stays dormant (off state) until N customers accumulate in the queue and then starts an exhaustive service (on state). When the system reaches the empty state, the server resumes closedown work. After the closedown, the server stays idle and waits N accumulate for service. When the Nth customer enters the queue, the server starts an exhaustive service. After finishing the service, the unsatisfied customers may request another service (re-service) immediately. The arrivals may either balk or join the queue when the system size is less than N. The system distributions are derived for the model under consideration.The important system performance indices are obtained and numerical simulations are also presented.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information. Also: DOI is paid service which provided by a third party. We never mentioned that we go for this for our any journal. However, journal have no objection if author go directly for this paid DOI service.