A Branch-Bound Solution to the General Scheduling Problem

Harold H. Greenberg
Additional contact information
Harold H. Greenberg: General Electric Company, Denver, Colorado

Operations Research, 1968, vol. 16, issue 2, 353-361

Abstract: A mixed integer formulation is presented for the general n job, m machine scheduling problem. This formulation is shown to reduce to a series of noninteger L.P. problems of moderate proportions when applying the branch-bound technique. Solutions are presented for the two problems: minimize make-span and minimize idle time. An example and some computational experience for the “minimize idle time” problem are given.

Date: 1968
References: Add references at CitEc
Citations: View citations in EconPapers (11)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.2.353 (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:16:y:1968:i:2:p:353-361

Access Statistics for this article

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