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

Optimal control of batch service queues with finite service capacity and linear holding costs

Author

Listed:
  • Samuli Aalto

Abstract

We consider the optimal control problem of certain batch service queueing systems with compound Poisson arrivals and linear holding costs. The control problem involves the determination of the epochs at which the service is initiated as well as the sizes of the batches served. The service times are assumed to be independent and identically distributed, however, with a general distribution. A quite natural operating policy is to start the service as soon as the number of customers reaches some threshold and serve always as many customers as possible. Assuming infinite service capacity Deb [4] proved that under some mild conditions the optimal operating policy is of this type. In this paper we show that a similar result is valid even if the service capacity is finite. In this case the threshold is never greater than Q, the service capacity (the maximum number of customers that can be served at the same time). Copyright Springer-Verlag Berlin Heidelberg 2000

Suggested Citation

  • Samuli Aalto, 2000. "Optimal control of batch service queues with finite service capacity and linear holding costs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 51(2), pages 263-285, April.
    • Handle: RePEc:spr:mathme:v:51:y:2000:i:2:p:263-285
    DOI: 10.1007/s001860050088
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s001860050088
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s001860050088?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. Jan-Kees Ommeren & Niek Baer & Nishant Mishra & Debjit Roy, 2020. "Batch service systems with heterogeneous servers," Queueing Systems: Theory and Applications, Springer, vol. 95(3), pages 251-269, August.
    2. Yoshiaki Inoue, 2022. "A load-balancing problem for distributed bulk-service queues with size-dependent batch processing times," Queueing Systems: Theory and Applications, Springer, vol. 100(3), pages 449-451, April.

    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:51:y:2000:i:2:p:263-285. 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.