文章基本信息

标题：Heuristic algorithms for two-machine job shop problem under availability constraints on one machine: makespan minimization
本地全文：下载
作者：Mourad Benttaleb ; Faicel Hnaien ; Farouk Yalaoui 等
期刊名称：IFAC PapersOnLine
印刷版ISSN：2405-8963
出版年度：2018
卷号：51
期号：11
页码：1065-1070
DOI：10.1016/j.ifacol.2018.08.466
语种：English
出版社：Elsevier
摘要：AbstractWe discuss the two-machine job shop scheduling problem with availability constraints on one machine for maximum completion time (makespan) minimization. We consider the problem when unavailability periods are planned in advance and operations are non-preemptive. Firstly, some propositions considering Jackson’s rule under availability constraints are introduced. Then, we provide polynomial-time algorithm based on Jackson’s rule and an iterated local search tabu based algorithm exploiting the optimality of Jackson’s rule between each two consecutive availability periods to solve the problem. Finally, we present some experimental results.
关键词：KeywordsJob shopAvailability constraintMakespanApproximation algorithmIterated local search