Scheduling tasks on a radar system can be modeled as a multi-operation scheduling problem where tasks are composed of two operations separated by a fixed duration. Tasks have to be scheduled on a single machine and the aim is to minimize the makespan. The complexity status of this problem has been settled for various cases but the one where all tasks are identical remains open. This paper aims at showing that this case raises original and difficult problems and is highly unlikely to be polynomial.