This paper presents a Branch, Bound, and Remember (BB&R) exact algorithm using the Cyclic Best First Search (CBFS) exploration strategy for solving the <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$${1|ST_{sd}|\sum T_{i}}$$</EquationSource> </InlineEquation> scheduling problem, a single machine scheduling problem with sequence dependent setup times where the objective is...</equationsource></inlineequation>