UNIGE document Scientific Article
previous document  unige:156805  next document
add to browser collection
Title

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

Authors
Krim, Hanane
Potvin, Jean-Yves
Benmansour, Rachid
Duvivier, David
Published in Journal of scheduling. 2021
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.
Keywords Parallel machine scheduling · Job rejection · Periodic maintenance · MixedIntegerLinearProgram · Metaheuristic · Tabu search · Lexicographic optimization
Identifiers
Full text
Structures
Citation
(ISO format)
KRIM, Hanane et al. Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times. In: Journal of scheduling, 2021. doi: 10.1007/s10951-021-00711-9 https://archive-ouverte.unige.ch/unige:156805

54 hits

28 downloads

Update

Deposited on : 2021-11-30

Export document
Format :
Citation style :