Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times - Université Polytechnique des Hauts-de-France Access content directly
Journal Articles Journal of Scheduling Year : 2021

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times

Abstract

We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.
Fichier principal
Vignette du fichier
s10951-021-00711-9.pdf (590.92 Ko) Télécharger le fichier
Origin : Publication funded by an institution
Licence : CC BY - Attribution

Dates and versions

hal-03528137 , version 1 (29-08-2022)

Licence

Attribution

Identifiers

Cite

Hanane Krim, Nicolas Zufferey, Jean-Yves Potvin, Rachid Benmansour, David Duvivier. Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times. Journal of Scheduling, 2021, ⟨10.1007/s10951-021-00711-9⟩. ⟨hal-03528137⟩
28 View
12 Download

Altmetric

Share

Gmail Facebook X LinkedIn More