Skip to Main content Skip to Navigation
Reports

Tabu Search for a Parallel-Machine Scheduling Problem with Job Rejection, Inventory Penalties and Periodic Maintenance.

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 :
Reports
Complete list of metadata

https://hal-uphf.archives-ouvertes.fr/hal-03388837
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Wednesday, October 20, 2021 - 4:25:14 PM
Last modification on : Wednesday, November 3, 2021 - 4:42:19 AM

Identifiers

  • HAL Id : hal-03388837, version 1

Collections

Citation

Hanane Krim, Nicolas Zufferey, Jean-Yves Potvin. Tabu Search for a Parallel-Machine Scheduling Problem with Job Rejection, Inventory Penalties and Periodic Maintenance.. [Research Report] CIRRELT; LAMIH, Université Polytechnique des Hauts-de-France. 2020. ⟨hal-03388837⟩

Share

Metrics

Record views

11