The flow-shop sequencing problem with no wait in process and with jobs requiring dissimilar technological order for machine processing is formulated in this paper. A systematic method is suggested for obtaining the optimum solution to the sequencing problem. An example of four jobs with four technological orderings for machine processing and four machines is solved to illustrate the suggested method.