No-wait flow shop scheduling refers to a continuous flow of jobs through machines. The job once started should have continuous processing through the machines without a wait. This situation occurs when there is a lack of intermediate storage between the handling of jobs on two consecutive machines, or the manufacturing system does so. The problem of no-wait with the objective of minimizing makespan in flow shop scheduling is NP-hard; therefore, the heuristic algorithms are the key to solving the problem with the optimal solution or to approach nearer to the optimal solution in a straightforward manner. The paper describes an algorithm using a heuristic technique for sequencing n-jobs through m-machines in a flow shop under no-wait constraint with the objective of minimizing makespan. The problems found in the literature are solved using the proposed heuristic algorithm, and the comparisons of results are done with the corresponding methods. To explain the computational process of proposed algorithm, numerical illustrations are also given in the paper.