Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message

Login Alert

Cancel
Log in
×
×
Register
Log In
(0) Cart
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.

Cited by
  • Crossref logo 18
  • Google Scholar logo
Crossref Citations
Crossref logo
This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Lucantoni, David M. 1993. Performance Evaluation of Computer and Communication Systems. Vol. 729, Issue. , p. 330.
  • CrossRef
  • Google Scholar

Schellhaas, Helmut 1994. Single server queues with a batch Markovian arrival process and server vacations. OR Spektrum, Vol. 15, Issue. 4, p. 189.
  • CrossRef
  • Google Scholar

Machihara, Fumiaki 1995. AG/SM/1queue with vacations depending on service times. Communications in Statistics. Stochastic Models, Vol. 11, Issue. 4, p. 671.
  • CrossRef
  • Google Scholar

Takine, Tetsuya and Takahashi, Yoshitaka 1998. On the relationship between queue lengths at a random instant and at a departure in the stationary queue with bmap arrivals. Communications in Statistics. Stochastic Models, Vol. 14, Issue. 3, p. 601.
  • CrossRef
  • Google Scholar

Tian, Naishuo Li, Quan-Lin and Gao, Jinhua 1999. Conditional stochastic decompositions in the M/M/c queue with server vacations. Communications in Statistics. Stochastic Models, Vol. 15, Issue. 2, p. 367.
  • CrossRef
  • Google Scholar

Sikdar, K. and Gupta, U. C. 2005. The queue length distributions in the finite buffer bulk-service MAP/G/1 queue with multiple vacations. Top, Vol. 13, Issue. 1, p. 75.
  • CrossRef
  • Google Scholar

Chang, Seok Ho and Takine, Tetsuya 2005. Factorization and Stochastic Decomposition Properties in Bulk Queues with Generalized Vacations. Queueing Systems, Vol. 50, Issue. 2-3, p. 165.
  • CrossRef
  • Google Scholar

Banik, A.D. Gupta, U.C. and Pathak, S.S. 2006. BMAP/G/1/N queue with vacations and limited service discipline. Applied Mathematics and Computation, Vol. 180, Issue. 2, p. 707.
  • CrossRef
  • Google Scholar

Tian, Naishuo and Zhang, Zhe George 2006. Vacation Queueing Models Theory and Applications. Vol. 93, Issue. , p. 359.
  • CrossRef
  • Google Scholar

Gupta, U.C. and Sikdar, Karabi 2006. Computing queue length distributions in MAP/G/1/N queue under single and multiple vacation. Applied Mathematics and Computation, Vol. 174, Issue. 2, p. 1498.
  • CrossRef
  • Google Scholar

Banik, A. D. and Gupta, U. C. 2007. Analyzing the finite buffer batch arrival queue under Markovian service process: GI X /MSP/1/N . TOP, Vol. 15, Issue. 1, p. 146.
  • CrossRef
  • Google Scholar

Saffer, Zsolt and Telek, Miklós 2008. Computer Performance Engineering. Vol. 5261, Issue. , p. 212.
  • CrossRef
  • Google Scholar

Zhao, Qinggui Zhang, Xuan and Kong, Xiangxing 2009. The Queue Length of GI/G/1 Queueing System with Server Setup Times. p. 702.
  • CrossRef
  • Google Scholar

Kempa, Wojciech M. 2009. Some New Results for Departure Process in theMX/G/1 Queueing System with a Single Vacation and Exhaustive Service. Stochastic Analysis and Applications, Vol. 28, Issue. 1, p. 26.
  • CrossRef
  • Google Scholar

Banik, A.D. 2009. The infinite-buffer single server queue with a variant of multiple vacation policy and batch Markovian arrival process. Applied Mathematical Modelling, Vol. 33, Issue. 7, p. 3025.
  • CrossRef
  • Google Scholar

Banik, A. D. 2013. Analysis of Queue-Length Dependent Vacations and P-Limited Service in BMAP/G/1/N Systems: Stationary Distributions and Optimal Control. International Journal of Stochastic Analysis, Vol. 2013, Issue. , p. 1.
  • CrossRef
  • Google Scholar

Datta Banik, Abhijit 2013. Stationary distributions and optimal control of queues with batch Markovian arrival process under multiple adaptive vacations. Computers & Industrial Engineering, Vol. 65, Issue. 3, p. 455.
  • CrossRef
  • Google Scholar

Claeys, Dieter Steyaert, Bart Walraevens, Joris Laevens, Koenraad and Bruneel, Herwig 2013. Analysis of a versatile batch-service queueing model with correlation in the arrival process. Performance Evaluation, Vol. 70, Issue. 4, p. 300.
  • CrossRef
  • Google Scholar

Google Scholar Citations

View all Google Scholar citations for this article.

×
Cambridge University Press

Our Site

  • Accessibility
  • Contact & Help
  • Legal Notices

Our Platforms

  • Cambridge Core
  • Cambridge Open Engage
  • Cambridge Higher Education

Our Products

  • Journals
  • Books
  • Elements
  • Textbooks
  • Courseware

Join us online

Please choose a valid location.

  • Rights & Permissions
  • Copyright
  • Privacy Notice
  • Terms of Use
  • Cookies Policy
Cambridge University Press 2025

Cancel
Confirm
×

Save article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

The BMAP/GI/1 queue with server set-up times and server vacations
  • Volume 25, Issue 1
  • Josep M. Ferrandiz (a1)
  • DOI: https://doi.org/10.2307/1427504
Please provide your Kindle email.
Available formats Please select a format to save.
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

The BMAP/GI/1 queue with server set-up times and server vacations
  • Volume 25, Issue 1
  • Josep M. Ferrandiz (a1)
  • DOI: https://doi.org/10.2307/1427504
Available formats Please select a format to save.
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

The BMAP/GI/1 queue with server set-up times and server vacations
  • Volume 25, Issue 1
  • Josep M. Ferrandiz (a1)
  • DOI: https://doi.org/10.2307/1427504
Available formats Please select a format to save.
×
×

Reply to: Submit a response

Contents help
Close Contents help

- No HTML tags allowed
- Web page URLs will display as text only
- Lines and paragraphs break automatically
- Attachments, images or tables are not permitted

Please enter your response.

Your details

Email help
Close Email help

Your email address will be used in order to notify you when your comment has been reviewed by the moderator and in case the author(s) of the article or the moderator need to contact you directly.

Please enter a valid email address.

You have entered the maximum number of contributors

Conflicting interests

Do you have any conflicting interests? * Conflicting interests help

Close Conflicting interests help

Please list any fees and grants from, employment by, consultancy for, shared ownership in or any close relationship with, at any time over the preceding 36 months, any organisation whose interests may be affected by the publication of the response. Please also list any non-financial associations or interests (personal, professional, political, institutional, religious or other) that a reasonable reader would want to know about in relation to the submitted work. This pertains to all the authors of the piece, their spouses or partners.