Two-machine job shop problem for makespan minimization under availability constraint - Archive ouverte HAL Access content directly
Journal Articles IFAC-PapersOnLine Year : 2016

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

(1) , (1) , (1)
1

Abstract

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.

Dates and versions

hal-02525211 , version 1 (30-03-2020)

Identifiers

Cite

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⟩

Collections

CNRS UTT LOSI
15 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More