Branch and Bound Methods for Multi-Item Scheduling

Dennis J. Sweeney and Richard A. Murphy
Additional contact information
Dennis J. Sweeney: University of Cincinnati, Cincinnati, Ohio
Richard A. Murphy: University of Cincinnati, Cincinnati, Ohio

Operations Research, 1981, vol. 29, issue 5, 853-864

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.

Keywords: 627 special ordered sets; 633 multi-item scheduling; 635 large scale integer programs (search for similar items in EconPapers)
Date: 1981
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.29.5.853 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:29:y:1981:i:5:p:853-864

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().