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

Control policy of a hysteretic queueing system

Author

Listed:
  • Lotfi Tadj
  • Jau-Chuan Ke

Abstract

This paper is concerned with the optimal control of a bulk service queueing system under N-policy. If the number of customers in the system at a service completion is larger than some integer r, then the server starts processing a group of r customers. If, on the other hand, it is smaller than r, then the server goes through an idle period and waits for the line to grow up to some integer N (N ≥ r). We present some system characteristics by means of the embedded Markov chains and semi-regenerative techniques. We also construct the expected total cost for this model and develop a procedure to determine the optimal thresholds r and N that yield the minimum cost. Copyright Springer-Verlag Berlin Heidelberg 2003

Suggested Citation

  • Lotfi Tadj & Jau-Chuan Ke, 2003. "Control policy of a hysteretic queueing system," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 57(3), pages 367-376, August.
    • Handle: RePEc:spr:mathme:v:57:y:2003:i:3:p:367-376
    DOI: 10.1007/s001860200264
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Mouloud Cherfaoui & Aicha Bareche, 2020. "An optimal approximation of the characteristics of the GI/M/1 queue with two-stage service policy," Operational Research, Springer, vol. 20(2), pages 959-983, June.

    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:57:y:2003:i:3:p:367-376. 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.