IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v113y2002i1p81-10010.1023-a1020953726925.html
   My bibliography  Save this article

A Regularly Preemptive Model and its Approximations

Author

Listed:
  • Fumiaki Machihara
  • Yuichi Aono

Abstract

A regularly preemptive model D,MAP/D 1 ,D 2 /1 is studied. Priority customers have constant inter-arrival times and constant service times. On the other hand, ordinary customers' arrivals follow a Markovian Arrival Process (MAP) with constant service times. Although this model can be formulated by using the piecewise Markov process, there remain some difficult problems on numerical calculations. In order to solve these problems, a novel approximation model MAP/MR/1 with Markov renewal services is proposed. These two queueing processes become different due to the existence of idle periods. Thus, a MAP/MR/1 queue with a general boundary condition is introduced. It is a model with the exceptional first service in each busy period. In particular, two special models are studied: one is a warm-up queue and the other is a cool-down queue. It can be proved that the waiting time of ordinary customers for the regular preemption model is stochastically smaller than the waiting time of the former model. On the other hand, it is stochastically larger than the waiting time of the latter model. Copyright Kluwer Academic Publishers 2002

Suggested Citation

  • Fumiaki Machihara & Yuichi Aono, 2002. "A Regularly Preemptive Model and its Approximations," Annals of Operations Research, Springer, vol. 113(1), pages 81-100, July.
    • Handle: RePEc:spr:annopr:v:113:y:2002:i:1:p:81-100:10.1023/a:1020953726925
    DOI: 10.1023/A:1020953726925
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1020953726925
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1020953726925?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.

    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:annopr:v:113:y:2002:i:1:p:81-100:10.1023/a:1020953726925. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.