IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v60y2022i17p5176-5200.html
   My bibliography  Save this article

Supervised-learning-based approximation method for multi-server queueing networks under different service disciplines with correlated interarrival and service times

Author

Listed:
  • Siamak Khayyati
  • Barış Tan

Abstract

Developing efficient performance evaluation methods is important to design and control complex production systems effectively. We present an approximation method (SLQNA) to predict the performance measures of queueing networks composed of multi-server stations operating under different service disciplines with correlated interarrival and service times with merge, split, and batching blocks separated with infinite capacity buffers. SLQNA yields the mean, coefficient of variation, and first-lag autocorrelation of the inter-departure times and the distribution of the time spent in the block, referred as the cycle time at each block. The method generates the training data by simulating different blocks for different parameters and uses Gaussian Process Regression to predict the inter-departure time and the cycle time distribution characteristics of each block in isolation. The predictions obtained for one block are fed into the next block in the network. The cycle time distributions of the blocks are used to approximate the distribution of the total time spent in the network (total cycle time). This approach eliminates the need to generate new data and train new models for each given network. We present SLQNA as a versatile, accurate, and efficient method to evaluate the cycle time distribution and other performance measures in queueing networks.

Suggested Citation

  • Siamak Khayyati & Barış Tan, 2022. "Supervised-learning-based approximation method for multi-server queueing networks under different service disciplines with correlated interarrival and service times," International Journal of Production Research, Taylor & Francis Journals, vol. 60(17), pages 5176-5200, September.
  • Handle: RePEc:taf:tprsxx:v:60:y:2022:i:17:p:5176-5200
    DOI: 10.1080/00207543.2021.1951448
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2021.1951448
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2021.1951448?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:60:y:2022:i:17:p:5176-5200. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.