Authors: Macedo, Rita
Benmansour, Rachid
Artiba, Abdelhakim
Mladenović, Nenad 
Urošević, Dragan 
Title: Scheduling preventive railway maintenance activities with resource constraints
Journal: Electronic Notes in Discrete Mathematics
Volume: 58
First page: 215
Last page: 222
Conference: 4th International Conference on Variable Neighborhood Search
Issue Date: 1-Apr-2017
Rank: M30
ISSN: 1571-0653
DOI: 10.1016/j.endm.2017.03.028
In this paper, we focus on the scheduling of preventive railway maintenance activities. The objective is to keep the railway infrastructure in good operating conditions at low costs, also taking into account the limited available resources in what concerns crew members. Equipments degrade with usage and age and a good preventive maintenance program can greatly reduce their unreliability in the sense that expectable failures can be anticipated. We propose a mixed integer programming formulation for the problem of scheduling preventive railway maintenance activities and a Variable Neighborhood Search (VNS) algorithm to solve large instances of the problem.
Keywords: maintenance | railway | 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.