We consider a problem where tasks are independent and can neither begin nor end at some dates. The objective is to schedule the tasks on a single machine in order to minimize the makespan. This problem is NP-hard and does not belong to APX. We propose a fixed-parameter algorithm for a particular case of this problem. We show that this case is FPT even under High Multiplicity encoding.