Skip to Main content Skip to Navigation
Journal articles

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

https://hal-uphf.archives-ouvertes.fr/hal-03528137
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, August 29, 2022 - 12:33:21 PM
Last modification on : Wednesday, August 31, 2022 - 11:22:06 AM

File

s10951-021-00711-9.pdf
Publication funded by an institution

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

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, Springer Verlag, 2021, ⟨10.1007/s10951-021-00711-9⟩. ⟨hal-03528137⟩

Share

Metrics

Record views

17

Files downloads

1