The purpose of this paper is to develope a heuristic algorithm to maximize reduction rate of the processing time by the connection of neighbored machines. A method to calculate the start-lag and stop-lag for the overlapping production is proposed and applied. The heuristic procedure of this paper has 3 steps. In the first and second step, the job oriented procedure is applied. In the final step, the operation oriented procedure is applied. In order to evaluate the performance of this algorithm, three kinds of performance measures are selected and randomly generated problems are tested.