This paper considers a generalization of the classical flow-shop problem where n items, grouped into k fixed sequences (clusters) are processed on m machines. A permutation is being sought that minimizes the completion time of processing all items. This paper develops conditions when the clustered problem can be reduced to a classical case. It also provides sufficient optimality conditions for an approximate solution generated by a method for the two machine clustered problem.