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

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 des matières

Introduction.- The Capacitated Planned Maintenance Problem.- Known concepts and solution techniques.- The Weighted Uncapacitated Planned Maintenance Problem.- Analyzing the solvability of the Capacitated Planned Maintenance Problem.- Algorithms for the Capacitated Planned Maintenance Problem.-Computations for the Capacitated Planned Maintenance Problem.- Final remarks and future perspectives. 

A propos de l'auteur

Torben Kuschel's academic passion is Operations Research and Operations Management since 2004. He is a researcher at the University of Wuppertal, Germany. 

Résumé

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.

Détails du produit

• Auteurs: Torben Kuschel
• Edition: Springer, Berlin
• Langues: Anglais
• Format d'édition: Livre de poche
• Sortie: 01.01.2016
• EAN: 9783319402888
• ISBN: 978-3-31-940288-8
• Pages: 286
• Dimensions: 184 mm x 238 mm x 18 mm
• Poids: 500 g
• Illustrations: XXIX, 286 p. 17 illus., 9 illus. in color.
• Thèmes: Lecture Notes in Economics and Mathematical Systems; Lecture Notes in Economics and Mathematical Systems
• Catégories: Sciences naturelles, médecine, informatique, technique > Mathématiques; Sciences sociales, droit, économie > Economie > Général, dictionnaires; Operations Research, B, Algorithms, Optimization, Economics, Business and Management, geometry, Combinatorics, Production, Operations Research/Decision Theory, Operations Research and Decision Theory, Theory of Computation, Discrete Mathematics, Management decision making, Management science, Algorithms & data structures, Combinatorics & graph theory, Decision Making, Production management, Mathematical optimization, Algorithm Analysis and Problem Complexity, Production & quality control management, Polytopes