Existing methods are reviewed and new heuristics examined and developed for the flow-shop scheduling problem. Comparative tests are carried out using simulation methods on different sizes of problem and with different variability of processing time data. New heuristic scheduling rules are determined which give high performance for flow-shop scheduling where there is (i) no job-passing and (ii) no job-waiting.