Flow-Shop Scheduling with the Branch-and-Bound Method

G. B. McMahon and P. G. Burton
Additional contact information
G. B. McMahon: CSIRO Wool Research Laboratories, Ryde, Sydney, Australia
P. G. Burton: CSIRO Wool Research Laboratories, Ryde, Sydney, Australia

Operations Research, 1967, vol. 15, issue 3, 473-481

Abstract: The branch-and-bound technique has been applied to the three machine flow shop problem where the objective is to minimize makespan. A new method of obtaining the bound has been developed. Rules for ordering the machines and listing the jobs prior to application of the algorithm have been proposed. Computational results are given for a large number of job sets up to 10 jobs, and for a few cases up to 45 jobs.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.3.473 (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:15:y:1967:i:3:p:473-481

Access Statistics for this article

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