Abstract
The problem of scheduling the production of lots of n products on a single facility is treated with the objective of minimizing the combined costs of setup, inventory, and backorder over a specified planning horizon. The discussion extends one of Elmaghraby's models (4) by developing a branch-and-bound algorithm which incorporates a dominance rule, a global precedence relation, and several local precedence relations.