Time Indexed Formulations for Scheduling Chains on a Single Machine: An Application to Airborne Radars

Philippe Baptiste (1) , Ruslan Sadykov (2, 3)

1 LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau]
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
3 IMB - Institut de Mathématiques de Bordeaux

Airborne radars are widely used to perform a large variety of tasks in an aircraft (searching, tracking, identifying targets, etc.) Such tasks play a crucial role for the aircraft and they are repeated in a ``more or less'' cyclic fashion. This defines a scheduling problem that impacts a lot on the quality of the radar output and on the overall safety of the aircraft. In our model, jointly defined with ``Thales Airborne Systems'', the radar executes the schedule of the current time frame while the schedule of the next frame is computed. The radar is a single machine and a radar task is a job to be scheduled on the machine. A job consists of a chain of operations with identical processing times. The operations of the same job should be ideally scheduled with a given frequency, and any deviation from this frequency is penalized using a V-shape function. Our objective is then to minimize the total penalty. In this paper, we present three time indexed formulations for the problem. Two of the formulations are compact and can be solved directly by a Mixed-Integer Programming solver. The third formulation relies on a Branch-and-Price algorithm. Theoretical and experimental comparisons of the formulations are reported.

Mots clés: Scheduling; Integer Programming; OR in Military

Domaines: Recherche opérationnelle [math.OC]

Philippe Baptiste, Ruslan Sadykov. Time Indexed Formulations for Scheduling Chains on a Single Machine: An Application to Airborne Radars. European Journal of Operational Research, 2010, 203 (2), pp.476-483. ⟨10.1016/j.ejor.2009.07.037⟩. ⟨inria-00339639v2⟩