IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v125y2004i1p47-6810.1023-banor.0000011185.77227.ae.html
   My bibliography  Save this article

Combining Routing and Buffer Allocation Problems in Series-Parallel Queueing Networks

Author

Listed:
  • Sophia Daskalaki
  • J. MacGregor Smith

Abstract

Given a series-parallel queueing network topology with exponential servers of finite capacity, a systematic design methodology is presented that approximately solves the optimal routing and buffer space allocation problems within the network. The multi-objective stochastic nonlinear programming problem in integer variables is described and a two-stage iterative optimization procedure is presented which interconnects the routing and buffer space allocation problems. The algorithmic procedure couples the Expansion method, a decomposition method for computing performance measures in queueing networks with finite capacity, along with Powell's unconstrained optimization procedure which allocates the buffers and a multi-variable search procedure for determining the routing probabilities. The effectiveness and efficiency of the resulting two-stage design methodology is tested and evaluated in a series of experimental designs along with simulations of the network topologies. Copyright Kluwer Academic Publishers 2004

Suggested Citation

  • Sophia Daskalaki & J. MacGregor Smith, 2004. "Combining Routing and Buffer Allocation Problems in Series-Parallel Queueing Networks," Annals of Operations Research, Springer, vol. 125(1), pages 47-68, January.
    • Handle: RePEc:spr:annopr:v:125:y:2004:i:1:p:47-68:10.1023/b:anor.0000011185.77227.ae
    DOI: 10.1023/B:ANOR.0000011185.77227.ae
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/B:ANOR.0000011185.77227.ae
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/B:ANOR.0000011185.77227.ae?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. George Liberopoulos & George Kozanidis & Panagiotis Tsarouhas, 2007. "Performance Evaluation of an Automatic Transfer Line with WIP Scrapping During Long Failures," Manufacturing & Service Operations Management, INFORMS, vol. 9(1), pages 62-83, December.
    2. H. S. R. Martins & F. R. B. Cruz & A. R. Duarte & F. L. P. Oliveira, 2019. "Modeling and optimization of buffers and servers in finite queueing networks," OPSEARCH, Springer;Operational Research Society of India, vol. 56(1), pages 123-150, March.

    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:125:y:2004:i:1:p:47-68:10.1023/b:anor.0000011185.77227.ae. 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.