Summary: Decision rules are developed for sequencing a free flow production system. In the scheduling periods we have \(M\) kinds of jobs which are interchangeable in a certain sense. The processing time \(T(i,j)\) is different for the jobs. The objectives are minmax flow time \((F(M,N))\). Several results are derived on the application of the decision rules to search the optimum solution.