Authors: Todosijević, Raca 
Benmansour, Rachid
Hanafi, Saïd
Mladenović, Nenad 
Artiba, Abdelhakim
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Nested general variable neighborhood search for the periodic maintenance problem
Journal: European Journal of Operational Research
Volume: 252
Issue: 2
First page: 385
Last page: 396
Issue Date: 16-Jul-2016
Rank: M21a
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2016.01.014
In this paper we study the periodic maintenance problem: Given a set of m machines and a horizon of T periods, find indefinitely repeating itself maintenance schedule such that at most one machine can be serviced at each period. In addition, all the machines must be serviced at least once for any cycle. In each period the machine i generates a servicing cost bi or an operating cost which depends on the last period in which i was serviced. The operating cost of each machine i in a period equals ai times the number of periods since the last servicing of that machine. The main objective is to find a cyclic maintenance schedule of a periodicity T that minimizes total cost. To solve this problem we propose a new Mixed Integer programming formulation and a new heuristic method based on general Variable neighborhood search called Nested general variable neighborhood search. The performance of this heuristic is shown through an extensive experimentation on a diverse set of problem instances.
Keywords: Mixed-integer linear programming | Nested general VNS | Preventive maintenance | Scheduling | Variable neighborhood search
Publisher: Elsevier

Show full item record


checked on May 23, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.