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

Branch and Bound Methods for Multi-Item Scheduling

Author

Listed:
  • Dennis J. Sweeney

    (University of Cincinnati, Cincinnati, Ohio)

  • Richard A. Murphy

    (University of Cincinnati, Cincinnati, Ohio)

Abstract

This paper presents two solution approaches for the multi-item activity scheduling problem; a problem of practical importance because it models many resource allocation and combinatorial problems. Both approaches are easily incorporated into commercially available linear programming (LP) based branch-and-bound codes such as IBM's MPSX370-MIP. Many practitioners rely on such codes and will find these approaches useful. The first approach is a specialization of a method for decomposing integer programs with block angular structure. In the second approach, the reduced costs in the solution to the usual LP relaxation are used to develop improved priorities for branching. Computational results on real applications are reported using MPSX 370-MIP.

Suggested Citation

  • Dennis J. Sweeney & Richard A. Murphy, 1981. "Branch and Bound Methods for Multi-Item Scheduling," Operations Research, INFORMS, vol. 29(5), pages 853-864, October.
    • Handle: RePEc:inm:oropre:v:29:y:1981:i:5:p:853-864
    DOI: 10.1287/opre.29.5.853
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.29.5.853
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.29.5.853?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. Lin, Edward Y. H. & Bricker, Dennis L., 1996. "Computational comparison on the partitioning strategies in multiple choice integer programming," European Journal of Operational Research, Elsevier, vol. 88(1), pages 182-202, January.
    2. Yanyan Wang & Baiqing Sun, 2022. "Multiperiod optimal emergency material allocation considering road network damage and risk under uncertain conditions," Operational Research, Springer, vol. 22(3), pages 2173-2208, July.

    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:29:y:1981:i:5:p:853-864. 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.