Two-machine job shop problem for makespan minimization under availability constraint

Mourad Benttaleb (1) , Faicel Hnaien (1) , Farouk Yalaoui (1)

1 LOSI - Laboratoire d'Optimisation des Systèmes Industriels

We treat a two-machine job shop scheduling problem with availability constraint on one machine to minimize the makespan. We consider the deterministic case where the unavailability period, corresponding to preventive maintenance tasks, is known in advance and fixed. We assume that jobs are non-preemptive. First, two mixed-integer programming (MIP) models are first presented. Some propositions concerning the optimality of Jackson’s algorithm when availability constraint exists is provided. Then a branch and bound (B&B) method is developed to solve the problem. The obtained results prove the efficiency of the proposed B&B.

Mots clés: Job shop scheduling; Availability constraint; Preventive maintenance; Mixed Integer Programming; Branch; bound

Domaines: Recherche opérationnelle [math.OC]

Mourad Benttaleb, Faicel Hnaien, Farouk Yalaoui. Two-machine job shop problem for makespan minimization under availability constraint. IFAC-PapersOnLine, 2016, 49 (28), pp.132-137. ⟨10.1016/j.ifacol.2016.11.023⟩. ⟨hal-02525211⟩