Article Dans Une Revue RAIRO - Operations Research Année : 2019

A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance

Résumé

In this paper we propose to solve a single machine scheduling problem which has to undergo a periodic preventive maintenance. The objective is to minimize the weighted sum of the completion times. This criterion is defined as one of the most important objectives in practice but has not been studied so far for the considered problem. As the problem is proven to be NP-hard, and a mathematical model is proposed in the literature, we propose to use General Variable Neighborhood Search algorithm to solve this problem in order to obtain near optimal solutions for the large-sized instances in a small amount of computational time.

Fichier principal
Vignette du fichier
ro170170.pdf (276.65 Ko) Télécharger le fichier
Origine Publication financée par une institution
Licence
Loading...

Dates et versions

hal-02925341 , version 1 (29-08-2020)

Licence

Identifiants

Citer

Hanane Krim, Rachid Benmansour, David Duvivier, Abdelhakim Artiba. A variable neighborhood search algorithm for solving the single machine scheduling problem with periodic maintenance. RAIRO - Operations Research, 2019, 53 (1), pp.289-302. ⟨10.1051/ro/2018055⟩. ⟨hal-02925341⟩
77 Consultations
573 Téléchargements

Altmetric

Partager

  • More