This study presents two mixed integer programming models for scheduling hybrid flow shops with sequence dependent setup times. In the first model , we assumed the machines at each stage are identical, but in the second model the machines at each stage are different. These models may he used to determine optimal solutions for hybrid flow shop problems of moderate size, and these problems could then be used as benchmarks for testing new sequencing heuristics
)