This paper provides an evaluation of static flowshop scheduling heuristics for minimizing makespan as an objective function in the dynamic flowshop model, in which new jobs with stochastic processing times arrive at the shop randomly over time and are added into the waiting jobs for processing. A total of sixteen scheduling heuristics, including several revisions and combinations of previously reported me-sixteen scheduling heuristics, including several revisions and combinations of previously reported methods, are surmmarized. These scheduling rules are evaluated via computer using a SLAM discrete event simulation model. The results for the simulation are analyzed using both statistical and nonstatistical methods. The results from the study suggest which of the popular scheduling rules hold promise for application to practical dynamic flowshop problems.