IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v36y1990i4p513-516.html
   My bibliography  Save this article

Note---A Branch-and-Fathom Algorithm for the Long Range Process Design Problem

Author

Listed:
  • Jaya Singhal

    (Department of Information and Quantitative Sciences, University of Baltimore, 1420 N Charles Street, Baltimore, Maryland 21201)

  • Joseph L. Katz

    (Department of Decision Sciences, Georgia State University, Atlanta, Georgia 30303)

Abstract

Several problems, including the long-range process design problem, have been formulated as a compatibility matrix. Earlier, Singhal et al. (1988) proposed a partial enumeration algorithm which found all feasible designs and reported computational results. However, for large problems, the partial enumeration algorithm requires an excessive amount of computational effort to locate all feasible designs. This paper presents a branch and fathom algorithm which is more efficient than the partial enumeration algorithm, and which significantly reduces the computational effort necessary to identify all feasible designs.

Suggested Citation

  • Jaya Singhal & Joseph L. Katz, 1990. "Note---A Branch-and-Fathom Algorithm for the Long Range Process Design Problem," Management Science, INFORMS, vol. 36(4), pages 513-516, April.
    • Handle: RePEc:inm:ormnsc:v:36:y:1990:i:4:p:513-516
    DOI: 10.1287/mnsc.36.4.513
    as

    Download full text from publisher

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

    Citations

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


    Cited by:

    1. Singhal, Jaya & Singhal, Kalyan, 1996. "The number of feasible designs in a compatibility matrix," European Journal of Operational Research, Elsevier, vol. 94(1), pages 186-193, October.

    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:ormnsc:v:36:y:1990:i:4:p:513-516. 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.