A variant of the mixed-model sequencing problem on assembly lines is the one proposed by Yano and Rachamadugu. They consider time windows in workstations and the work overload concept (sum of differences between real completion time in the workstation and due dates, which depends on the time window value). This paper proposes some procedures for solving the problem, and compares them with others taken from literature using a computational experience.