Authors
Mourad Benttaleb, Faicel Hnaien, Farouk Yalaoui,
Title
Two-machine job shop problem for makespan minimization under availability constraint
In
IFAC-PapersOnLine
Volume
49
Issue
28
Pages
132 – 137
Publisher
ScienceDirect
Year
2016
Publisher's URL
http://dx.doi.org/http://dx.doi.org/10.1016/j.ifacol.2016.11.023
Indexed by
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.
Affiliations
Offprint