IDEAS home Printed from https://ideas.repec.org/a/spr/mathme/v47y1998i3p341-353.html
   My bibliography  Save this article

The M/M/c with critical jobs

Author

Listed:
  • Ivo Adan
  • Gerard Hooghiemstra

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. Copyright Physica-Verlag 1998

Suggested Citation

  • Ivo Adan & Gerard Hooghiemstra, 1998. "The M/M/c with critical jobs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 47(3), pages 341-353, October.
    • Handle: RePEc:spr:mathme:v:47:y:1998:i:3:p:341-353
    DOI: 10.1007/BF01198401
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/BF01198401
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/BF01198401?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Nico M. Van Dijk & Bernard F. Lamond, 1988. "Simple Bounds for Finite Single-Server Exponential Tandem Queues," Operations Research, INFORMS, vol. 36(3), pages 470-477, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Simon Martin & Isi Mitrani, 2008. "Analysis of job transfer policies in systems with unreliable servers," Annals of Operations Research, Springer, vol. 162(1), pages 127-141, September.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Kozlowski, Dawid & Worthington, Dave, 2015. "Use of queue modelling in the analysis of elective patient treatment governed by a maximum waiting time policy," European Journal of Operational Research, Elsevier, vol. 244(1), pages 331-338.
    2. Waal, P.R. & Dijk, N.M. van, 1988. "Monotonicity of performance measures in a processor sharing queue," Serie Research Memoranda 0051, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    3. Dijk, N.M. van, 1989. "Sensitivity error bounds for non-exponental stochastic networks," Serie Research Memoranda 0093, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    4. Nakade, Koichi, 2000. "New bounds for expected cycle times in tandem queues with blocking," European Journal of Operational Research, Elsevier, vol. 125(1), pages 84-92, August.
    5. Dijk, N.M. van, 1989. "Simple performance estimates and error bounds for slotted ALOHA loss systems," Serie Research Memoranda 0013, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    6. Dijk, N.M. van, 1989. "The importance of bias-terms for error bounds and comparison results," Serie Research Memoranda 0036, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.
    7. Dijk, N.M. van & Korezlioglu, H., 1991. "On product form approximations for communication networks with losses : error bounds," Serie Research Memoranda 0011, VU University Amsterdam, Faculty of Economics, Business Administration and Econometrics.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:mathme:v:47:y:1998:i:3:p:341-353. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.