This paper addresses the method to obtain the global optimum for no-wait flowshop scheduling with precedence constraints and sequence dependent setup time. The system is made up of a set of machines of various types and is no interruption between tasks in a job. The objective is to determine the job sequence for processing with minimum makespan. The sequencing problem with precedence constraints and sequence dependent setup times is equivalent to the travelling salesman problem. A mixed integer programming (MIP) model is presented to obtain the optimal schedule. It is known that the MIP model for no-wait flowshop scheduling is NP-hard. We developed the heuristic algorithm to gain the best solution. From the experiments, we see that the suggested algorithm generates the best job sequence efficiently.