Because of the fundamental role of production flow lines in modern industry, considerable attention has paid to how improve their efficiency. A particular performance measure indicating efficiency is throughput. Throughput is the number of completed units of work per time period in steady state. In general, the throughput of a production line increases, or at least remains constant, as the buffer capacities increase. A larger throughput is usually the consequence of a larger buffer configuration, which, in turn, yields a larger inventory accumulation. One of the main problems with designing a production flow line is to determine the appropriate amount of buffers between stations in order to achieve the goals. This is known as a Buffer Allocation Problem (BAP). The BAP is a nonlinear, multi-objective one in integer variables. The purpose of this paper is to present a Heuristic algorithm to find the optimal allocation of buffers that maximizes throughput. The main idea is to find the amount of buffers under which the system operates, as a system with infinite buffer capacity, so the stations will be independent of each other and throughput becomes maximum. Numerical results are used to demonstrate the accuracy of the proposed algorithm. The algorithm finds the allocation where it's throughput is maximum, or only slightly less than maximum. But where it's total buffer capacity is considerably less than optimal allocation.