A forward branch-and-search algorithm and forecast horizon results for the changeover scheduling problem

This paper considers the problem of minimizing the total schedule changeover cost when faced with scheduling multiple products on a finite capacity resource. Several new analytical results are presented for this problem. These results are then used in developing a forward-time branch-and-search algorithm and forecast horizon results for the problem. We also present computational results to investigate the effectiveness of the forecast horizon results.