Capacitated Planned Maintenance
Models, Optimization Algorithms, Combinatorial and Polyhedral Properties

Authors: Torben Kuschel



Presents practically relevant, deterministic optimization models and novel algorithms for planned maintenance

Analyzes the computational complexity of several problem classes, polyhedral properties and lower bounds

Includes implementation details and an introduction to the necessary theory

This book examines the problem of maintenance planning and scheduling in industrial production systems. It presents two practically relevant, deterministic mathematical models: the capacitated planned maintenance problem (CPMP) and the weighted uncapacitated planned maintenance problem (WUPMP). It introduces specific optimization algorithms such as construction heuristics, Lagrangean and tabu search metaheuristics. A problem independent hybrid approach links and alternates between two Lagrangean relaxations. It also analyzes the solvability with respect to the computational complexity of several problem classes, polyhedral properties and lower bounds. Computational studies demonstrate the performance of the heuristics, lower bounds, subgradients obtained from heuristics and the quality of dual information. This unique book includes implementation details and an introduction to the necessary theory making it suitable for upper undergraduate students.

Table of contents

Front Matter
Pages i-xxix

Introduction
Pages 1-6

The Capacitated Planned Maintenance Problem
Pages 7-24

Known Concepts and Solution Techniques
Pages 25-70

The Weighted Uncapacitated Planned Maintenance Problem
Pages 71-102

Analyzing the Solvability of the Capacitated Planned Maintenance Problem
Pages 103-164

Algorithms for the Capacitated Planned Maintenance Problem
Pages 165-222

Computations for the Capacitated Planned Maintenance Problem
Pages 223-265

Final Remarks and Future Perspectives
Pages 267-271

Back Matter
Pages 273-286