Timing problem for scheduling an airborne radar

In this abstract, we consider a generalization of the one-machine earliness-tardiness scheduling problem (OMETSP). In the OMETSP settings, the due dates are constants given in the input, whereas in this generalization, the due dates depend on the starting time of another job (called reference job). Ou