A recursive algorithm for a pipeline maintenance scheduling problem
Assia Boumahdaf (LSTA), Michel Broniatowski (LSTA)

TL;DR
This paper presents a polynomial-time recursive algorithm for optimizing preventive maintenance scheduling of pipelines with corrosion defects, balancing inspection and repair costs within a decision support framework.
Contribution
It introduces a novel polynomial-time algorithm for joint inspection and repair scheduling, improving decision-making in pipeline maintenance.
Findings
The algorithm computes optimal maintenance schedules efficiently.
Different maintenance strategies are suggested based on cost minimization.
The approach supports practical decision-making for pipeline maintenance.
Abstract
This paper deals with the problem of preventive maintenance (PM) scheduling of pipelines subject to external corrosion defects. The preventive maintenance strategy involves an inspection step at some epoch, together with a repair schedule. This paper proposes to determine the repair schedule as well as an inspection time minimizing the maintenance cost. This problem is formulated as a binary integer non-linear programming model and we approach it under a decision support framework. We derive a polynomial-time algorithm that computes the optimum PM schedule and suggests different PM strategies in order to assist practitioners in making decision.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReliability and Maintenance Optimization · Energy Efficiency and Management · Scheduling and Optimization Algorithms
