Skip to Main content Skip to Navigation
Journal articles

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

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.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02525211
Contributor : Daniel Gavrysiak <>
Submitted on : Monday, March 30, 2020 - 6:18:53 PM
Last modification on : Tuesday, March 31, 2020 - 2:01:05 AM

Links full text

Identifiers

Collections

ROSAS | UTT | CNRS

Citation

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

Share

Metrics

Record views

17