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

✍ Scribed by Torben Kuschel (auth.)

Publisher: Springer International Publishing
Year: 2017
Tongue: English
Leaves: 309
Series: Lecture Notes in Economics and Mathematical Systems 686
Edition: 1
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

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

✦ Subjects

Operation Research/Decision Theory;Optimization;Production;Algorithm Analysis and Problem Complexity;Polytopes;Combinatorics

📜 SIMILAR VOLUMES

Sports Leagues Scheduling: Models, Combi

📁 Sports Leagues Scheduling: Models, Combinatorial Properties, and Optimization Algorithms

✍ Dirk Briskorn (auth.) 📂 Library 📅 2008 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

<p><P>In the context of sports leagues scheduling (SLS) several groups' interests must be taken into account. This book treats requirements for sport leagues schedules to be realizable from an operational and a security point of view, attractive for spectators and tv channels, and fair for the conam

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte, Jens Vygen 📂 Library 📅 2005 🏛 Springer 🌐 English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte, Jens Vygen 📂 Library 📅 2002 🏛 Springer 🌐 English

Combinatorial Optimization: Theory and A

📁 Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

✍ Bernhard Korte 📂 Library 📅 2012 🏛 Springer 🌐 English

<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This

Geometric Algorithms and Combinatorial O

📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)

✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English

This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and, in particular, combinatorial optimization. It offers a unifying approach which is based on two fundamental geometric algorithms: the ellipsoid method for finding a poin

Geometric Algorithms and Combinatorial O

📁 Geometric Algorithms and Combinatorial Optimization, Second Edition (Algorithms and Combinatorics)

✍ Martin Grötschel, Laszlo Lovasz, Alexander Schrijver 📂 Library 📅 1993 🏛 Springer 🌐 English