A beam search heuristic method for mixed-model scheduling with setups

However, the objectives of a low usage rate and a minimum number of setups are frequently in opposition with one another. To address this situation, this research presents an efficient frontier approach to support sequencing decisions that are made as a result of the compromise necessitated by these two conflicting goals. A beam-search heuristic is used to effectively generate the efficient frontiers needed to solve the problem.