Tabu Search for a Parallel-Machine Scheduling Problem with Job Rejection, Inventory Penalties and Periodic Maintenance. - Université Polytechnique des Hauts-de-France Access content directly
Reports (Research Report) Year : 2020

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.
No file

Dates and versions

hal-03388837 , version 1 (20-10-2021)

Identifiers

  • HAL Id : hal-03388837 , version 1

Cite

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⟩
10 View
0 Download

Share

Gmail Facebook X LinkedIn More