IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v39y1991i6p1005-1017.html
   My bibliography  Save this article

A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture

Author

Listed:
  • O. J. Boxma

    (CWI, Amsterdam, The Netherlands, and Tilburg University, Tilburg, The Netherlands)

  • G. A. P. Kindervater

    (Erasmus University, Rotterdam, The Netherlands)

Abstract

Partitioning methods lend themselves very well to implementation on parallel computers. In recent years, branch-and-bound algorithms have been tested on various types of architectures. In this paper, we develop a queueing network model for the analysis of a class of branch-and-bound algorithms on a master–slave architecture. The analysis is based on a fluid flow approximation. Numerical examples illustrate the concepts developed. Finally, related branch-and-bound algorithms are studied using a machine repair queueing model.

Suggested Citation

  • O. J. Boxma & G. A. P. Kindervater, 1991. "A Queueing Network Model for Analyzing a Class of Branch-and-Bound Algorithms on a Master–Slave Architecture," Operations Research, INFORMS, vol. 39(6), pages 1005-1017, December.
    • Handle: RePEc:inm:oropre:v:39:y:1991:i:6:p:1005-1017
    DOI: 10.1287/opre.39.6.1005
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.39.6.1005
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.39.6.1005?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
    ---><---

    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:inm:oropre:v:39:y:1991:i:6:p:1005-1017. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.