Abstract
Many researchers solve scheduling problems with sequence dependent set-up times using a travelling salesman problem formulation. We show that this reduction may produce poor solutions when applied to the cyclic lot scheduling problem. We propose one approach that may remedy the situation.