This paper addresses the problem of scheduling nn unit-time coupled operations on mm identical parallel machines with minimum time delay considerations so as to minimize the overall completion time, known as the makespan. Two approximation algorithms, along with their worst-case analysis, are presented.