Capacitated Planned Maintenance: Models, Optimization Algorithms, Combinatorial and Polyhedral Properties
Capacitated Planned Maintenance: Models, Optimization Algorithms, Combinatorial and Polyhedral Properties
Springer | Business & Management | December 2, 2016 | ISBN-10: 3319402889 | 286 pages | pdf | 5.51 mb
Springer | Business & Management | December 2, 2016 | ISBN-10: 3319402889 | 286 pages | pdf | 5.51 mb
Authors: Kuschel, Torben
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
Number of Pages
XXIX, 286
Number of Illustrations and Tables
8 b/w illustrations, 9 illustrations in colour
Topics
Operation Research/Decision Theory
Optimization
Production
Algorithm Analysis and Problem Complexity
Polytopes
Combinatorics
Keep Track of the latest Academic books by Clicking Here