Approximations algorithms for Single Machine Scheduling problem with Delayed Precedence Constraints

This paper presents a new approximation algorithm for the single machine scheduling problem with release times and delivery times, which includes additional conditions that require a certain delay between the completion of one task and the start of the next (delayed precedence constraints).A computational experiment has demonstrated that the proposed algorithm effectively creates schedules, and when combined with the well-known Jackson algorithm, it can enhance the quality of the final schedule.