The algorithm of Giffler and Thompson is modified for solving job shop scheduling problems related to the overlapping production The start-lag and stop-lag are also applied New priority rules for the overlapping production are proposed and the efficiency of them is compared with that of the classical priority rules.