This paper provides a survey and evaluation of static flowshop scheduling rules. A total of sixteen scheduling heuristics, including several revisions and combinations of previously reported methods, are summarized. These scheduling rules are evaluated using a discrete event simulation model. The results for the simulation model are analysed using both statistical and nonstatistical methods. The results from the study suggest which of the popular scheduling rules hold promise for application to practical flowshop problems.