Task scheduling with restricted preemptions on two parallel processors

In the paper a task scheduling problem on two parallel identical processors is considered. The objective is to find the schedule of minimum makespan. We assume that tasks are independent and can be preempted but preemption is only allowed if a task is continuously processed for at least k units of time. We propose two heuristic scheduling algorithms for such a problem and compare their effectiveness with other algorithms known from the literature.