We study the performance of scheduling algorithms for a manufacturing system, called the "No-wait Flowshop", which consists of a certain number of machine centers. Each center has one or more identical parallel machines. Each job is processed by at most one machine in each center. The problem of finding minimum finish time schedule is considered here in the two machine centers flowshop. Heuristic algorithms are presented and are analysed in the worst case performance context.