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

详细信息    查看全文

• 作者：Mourad Benttaleb^* ; ^{mourad.benttaleb@utt.fr} ; Faicel Hnaien^* ; ^{faicel.hnaien@utt.fr} ; Farouk Yalaoui^* ; ^{farouk.yalaoui@utt.fr}
• 关键词：Job shop scheduling ; Availability constraint ; Preventive maintenance ; Mixed Integer Programming ; Branch ; bound
• 刊名：IFAC-PapersOnLine
• 出版年：2016
• 出版时间：2016
• 年：2016
• 卷：49
• 期：28
• 页码：132-137
• 全文大小：373 K
• 卷排序：49

文摘

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.