In multiproduct manufacturing facilities, responsiveness to customers has always been a determining factor for competitiveness. In this study a product scheduling problem was addressed to minimize makespan with a secondary objective of minimizing setup times. A heuristic nondelay scheduling algorithm was modified and used to generate product schedules. Makespan was minimized using a most work remaining rule while the sequence dependent setup times were kept at low levels whenever possible. The algorithm was tested on 4 major products at 3 batch sizes and generated schedules within 5% of the lower bound. Analysis of cases where more than one machine, including the bottleneck, present sequence dependent setup times may produce tentative solutions for a commonly found problem that has not yet been addressed.