Skip to Main content Skip to Navigation
Journal articles

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

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

https://hal-utt.archives-ouvertes.fr/hal-02493944
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Friday, February 28, 2020 - 12:14:33 PM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM

Links full text

Identifiers

Collections

UTT | CNRS

Citation

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

Share

Metrics

Record views

61