A Multi-Period Renewal equipment problem - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue European Journal of Operational Research Année : 2012

A Multi-Period Renewal equipment problem

Résumé

This paper looks at a Multi-Period Renewal equipment problem (MPR). It is inspired by a specific real-life situation where a set of hardware items is to be managed and their replacement dates determined, given a budget over a time horizon comprising a set of periods. The particular characteristic of this problem is the possibility of carrying forward any unused budget from one period to the next, which corresponds to the multi-periodicity aspect in the model. We begin with the industrial context and deduce the corresponding knapsack model that is the subject of this paper. Links to certain variants of the knapsack problem are next examined. We provide a study of complexity of the problem, for some of its special cases, and for its continuous relaxation. In particular, it is established that its continuous relaxation and a special case can be solved in (strongly) polynomial time, that three other special cases can be solved in pseudo-polynomial time, while the problem itself is strongly NP-hard when the number of periods is unbounded. Next, two heuristics are proposed for solving the MPR problem. Experimental results and comparisons with the Martello&Toth and Dantzig heuristics, adapted to our problem, are provided.
Fichier principal
Vignette du fichier
MPR_EJOR.pdf (167.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00943850 , version 1 (14-02-2014)

Identifiants

Citer

Xiaokang Cao, Antoine Jouglet, Dritan Nace. A Multi-Period Renewal equipment problem. European Journal of Operational Research, 2012, 218 (3), pp.838-846. ⟨10.1016/j.ejor.2011.12.011⟩. ⟨hal-00943850⟩
130 Consultations
334 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More