Steady state analysis of a non-Markovian bulk queue with restricted vacations (Q545209): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / review text | |||
Summary: A \(M^{X}/G(a, b)/1\) queueing system with restricted number of vacations is considered here. After completing a bulk service, if the queue size is less than \(a\) then the server leaves for a vacation of random length. When he returns from a vacation, if queue length is still less than \(a\), he avails another vacation and so on until he completes \(M\) number of vacations in successions or he finds at least \(a\) customers wait for service. After \(M\) vacations, if the queue size is less than \(a\) then the server will remain in the system until he finds \(a\) customers in the queue. After a vacation or service completion if the server finds at least \(a\) customers waiting for service then the server serves according to Neut's bulk service rule. The probability generating function of queue size at an arbitrary time and some important system performance measures are obtained. Cost model is discussed with numerical illustration. | |||
Property / review text: Summary: A \(M^{X}/G(a, b)/1\) queueing system with restricted number of vacations is considered here. After completing a bulk service, if the queue size is less than \(a\) then the server leaves for a vacation of random length. When he returns from a vacation, if queue length is still less than \(a\), he avails another vacation and so on until he completes \(M\) number of vacations in successions or he finds at least \(a\) customers wait for service. After \(M\) vacations, if the queue size is less than \(a\) then the server will remain in the system until he finds \(a\) customers in the queue. After a vacation or service completion if the server finds at least \(a\) customers waiting for service then the server serves according to Neut's bulk service rule. The probability generating function of queue size at an arbitrary time and some important system performance measures are obtained. Cost model is discussed with numerical illustration. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90B22 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60K25 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 5911191 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
bulk service | |||
Property / zbMATH Keywords: bulk service / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
restricted vacations | |||
Property / zbMATH Keywords: restricted vacations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
supplementary variables | |||
Property / zbMATH Keywords: supplementary variables / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
vacations | |||
Property / zbMATH Keywords: vacations / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
dormant period | |||
Property / zbMATH Keywords: dormant period / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 01:35, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Steady state analysis of a non-Markovian bulk queue with restricted vacations |
scientific article |
Statements
Steady state analysis of a non-Markovian bulk queue with restricted vacations (English)
0 references
22 June 2011
0 references
Summary: A \(M^{X}/G(a, b)/1\) queueing system with restricted number of vacations is considered here. After completing a bulk service, if the queue size is less than \(a\) then the server leaves for a vacation of random length. When he returns from a vacation, if queue length is still less than \(a\), he avails another vacation and so on until he completes \(M\) number of vacations in successions or he finds at least \(a\) customers wait for service. After \(M\) vacations, if the queue size is less than \(a\) then the server will remain in the system until he finds \(a\) customers in the queue. After a vacation or service completion if the server finds at least \(a\) customers waiting for service then the server serves according to Neut's bulk service rule. The probability generating function of queue size at an arbitrary time and some important system performance measures are obtained. Cost model is discussed with numerical illustration.
0 references
bulk service
0 references
restricted vacations
0 references
supplementary variables
0 references
vacations
0 references
dormant period
0 references