Date

1968

Document Type

Thesis

Degree

Master of Science

Department

Industrial Engineering

First Adviser

Gary E. Whitehouse

Abstract

The branch-and-bound method for solving the single stage sequencing problem is investigated from the standpoint of the efficiency of the algorithmic search process as a function of the rule used for deciding on the node to branch from next.

Share

COinS