Heuristic algorithms for two-machine job shop problem under availability constraints on one machine: makespan minimization - Archive ouverte HAL Access content directly
Journal Articles IFAC-PapersOnLine Year : 2018

Heuristic algorithms for two-machine job shop problem under availability constraints on one machine: makespan minimization

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

Abstract

We 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.

Dates and versions

hal-02493944 , version 1 (28-02-2020)

Identifiers

Cite

Mourad Benttaleb, Faicel Hnaien, Farouk Yalaoui. Heuristic algorithms for two-machine job shop problem under availability constraints on one machine: makespan minimization. IFAC-PapersOnLine, 2018, 51 (11), pp.1065-1070. ⟨10.1016/j.ifacol.2018.08.466⟩. ⟨hal-02493944⟩

Collections

CNRS UTT LOSI
11 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More