Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

The M/M/c with critical jobs

  • Published:
Mathematical Methods of Operations Research Aims and scope Submit manuscript

Abstract

We consider theM/M/c queue, where customers transfer to a critical state when their queueing (sojourn) time exceeds a random time. Lower and upper bounds for the distribution of the number of critical jobs are derived from two modifications of the original system. The two modified systems can be efficiently solved. Numerical calculations indicate the power of the approach.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adan IJBF, Van Houtum GJ, Van der Wal J (1994) Upper and lower bounds for the waiting time in the symmetric shortest queue system. Annals of Operat. Research 48:197–217

    Google Scholar 

  2. — (1997) The symmetric longest queue system. Stochastic Models 13:105–120

    Google Scholar 

  3. Billingsley P (1968) Convergence of probability measures. John Wiley & Sons, Chichester

    Google Scholar 

  4. Van Dijk NM (1988) Simple bounds for queueing systems with breakdowns. Perf. Evaluation 8:117–128

    Google Scholar 

  5. — (1988) A formal proof for the insensitivity of simple bounds for finite multi-server non-exponential tandem queues. Stochastic Processes 27:261–277

    Google Scholar 

  6. Van Dijk NM, Lamond BF (1988) Simple bounds for finite single-server exponential tandem queues. Opns. Res. 36:470–477

    Google Scholar 

  7. Van Dijk NM, Van der Wal J (1989) Simple bounds and monotonicity results for finite multi-server exponential tandem queues. QUESTA 4:1–16

    Google Scholar 

  8. Hordijk A, Koole G (1992) On the assignment of customers to parallel queues. PEIS 6:495–511

    Google Scholar 

  9. Latouche G, Ramaswami V (1993) A logarithmic reduction algorithm for quasi-birth-death processes. J. Appl. Prob. 30:650–674

    Google Scholar 

  10. Neuts MF (1981) Matrix-geometric solutions in stochastic models. Johns Hopkins University Press, Baltimore

    Google Scholar 

  11. Van Rooij MCJ (1995) Quantitative models for maintenance optimization. Master's Thesis, Tilburg University

  12. De Waal PR (1992) Approximate analysis of an M/G/1 priority queue with priority changes due to impatience. CWI Report BS-R9202

  13. Van der Wal J (1989) Monotonicity of the throughput of a closed exponential queueing network in the number of jobs. OR Spektrum 11:97–100

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, Box 513, 5600, MB Eindhoven, The Netherlands

    Ivo Adan

  2. Department of Mathematics and Informatics, Delft University of Technology, Box 356, 2600, AJ Delft, The Netherlands

    Gerard Hooghiemstra

Authors
  1. Ivo Adan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerard Hooghiemstra
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Adan, I., Hooghiemstra, G. The M/M/c with critical jobs. Mathematical Methods of Operations Research 47, 341–353 (1998). https://doi.org/10.1007/BF01198401

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01198401

Key words

Search

Navigation