On a pattern sequencing problem to minimize the maximum number of open stacks

A branch and bound approach is proposed to address the problem of the minimization of open stack problem (MOSP). The method, which utilizes a greedy type strategy to choose the subsequent node to branch, aims to lessen the maximum number of open stacks during a production run. However, the method is computationally difficult to effect.