Skip to main content

Advanced Search

Projected result for your current search: 0

Search Operators:

You can use operators in your search query to narrow down your results even more. Click on the search operator to see an explanation of how it works.
Finds documents with exactly this word group, in exactly this word order and spelling (e.g. "employer branding").
Finds documents with both search terms (e.g. sales AND bonus).
Finds documents with one or the other search term (e.g. porsche OR volkswagen).
Finds documents with all search terms. Blank space is understood as AND (e.g. man robot production).
Finds documents with no appearance of the word behind NOT (e.g. ford NOT "harrison ford").
Finds documents where the search term is mentioned at least "n" times."n" may be any number (e.g. COUNT(gear)>8).
Finds documents with both search terms in any word order, permitting "n" words as a maximum distance between them. Best choose between 15 and 30 (e.g. NEAR(recruit, professionals, 20)).
Finds documents with the search term in word versions or composites. The asterisk * marks whether you wish them BEFORE, BEHIND, or BEFORE and BEHIND the search term (e.g. lightweight*, *lightweight, *lightweight*).
Finds documents with the search term in different spellings. "?" allows only one character (e.g. organi?ation).
Special characters are understood as AND (e.g. Miller Bros. & Sons).

Semantic Search

powered by (Link opens in a new window)
loading …
Log in
Top

On Finite Buffer BMAP/G/1 Queue with Queue Length Dependent Service

  • 2018
  • OriginalPaper
  • Chapter
Published in:
Authors
A. Banerjee
K. Sikdar
G. K. Gupta
Published in
Operations Research and Optimization
Publisher
Springer Singapore

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This paper deals with the analysis of a finite buffer queueing system where customers are arriving according to the batch Markovian arrival process (BMAP). The service time is considered to be generally distributed and is dependent on the queue length at service initiation epoch. The stationary queue length distribution at various epoch is obtained using the embedded Markov chain technique and the supplementary variable technique. A computational procedure has been discussed by considering phase-type service time distribution. Finally, some numerical results are given to show the numerical compatibility of the analytical results. Also a comparative study is carried out to establish the fact that our model may help in optimizing system performance by controlling the service rate depending on the state of the system.

Please log in to get access to your license.

Log in Register for free

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Business + Economics & Engineering + Technology"

Online-Abonnement

Springer Professional "Business + Economics & Engineering + Technology" gives you access to:

  • more than 102.000 books
  • more than 537 journals

from the following subject areas:

  • Automotive
  • Construction + Real Estate
  • Business IT + Informatics
  • Electrical Engineering + Electronics
  • Energy + Sustainability
  • Finance + Banking
  • Management + Leadership
  • Marketing + Sales
  • Mechanical Engineering + Materials
  • Insurance + Risk


Secure your knowledge advantage now!

inform now

Springer Professional "Engineering + Technology"

Online-Abonnement

Springer Professional "Engineering + Technology" gives you access to:

  • more than 67.000 books
  • more than 390 journals

from the following specialised fileds:

  • Automotive
  • Business IT + Informatics
  • Construction + Real Estate
  • Electrical Engineering + Electronics
  • Energy + Sustainability
  • Mechanical Engineering + Materials





 

Secure your knowledge advantage now!

inform now

Springer Professional "Business + Economics"

Online-Abonnement

Springer Professional "Business + Economics" gives you access to:

  • more than 67.000 books
  • more than 340 journals

from the following specialised fileds:

  • Construction + Real Estate
  • Business IT + Informatics
  • Finance + Banking
  • Management + Leadership
  • Marketing + Sales
  • Insurance + Risk



Secure your knowledge advantage now!

inform now
previous chapter A Solution Approach to Multi-level Nonlinear Fractional Programming Problem
next chapter Computational Analysis of a Single Server Queue with Batch Markovian Arrival and Exponential Single Working Vacation
Title
On Finite Buffer BMAP/G/1 Queue with Queue Length Dependent Service
Authors
A. Banerjee
K. Sikdar
G. K. Gupta
Copyright Year
2018
Publisher
Springer Singapore
Book
Operations Research and Optimization

Print ISBN: 978-981-10-7813-2

Electronic ISBN: 978-981-10-7814-9

Copyright Year: 2018

DOI
https://doi.org/10.1007/978-981-10-7814-9_4
This content is only visible if you are logged in and have the appropriate permissions.

Premium Partner

    Image Credits
    Neuer Inhalt/© ITandMEDIA, Nagarro GmbH/© Nagarro GmbH, AvePoint Deutschland GmbH/© AvePoint Deutschland GmbH, AFB Gemeinnützige GmbH/© AFB Gemeinnützige GmbH, USU GmbH/© USU GmbH, Ferrari electronic AG/© Ferrari electronic AG