Capacitated Planned Maintenance: Models, Optimization Algorithms, Combinatorial and Polyhedral Properties (Lecture Notes in Economics and Mathematical Systems, Band 686) - Softcover

Buch 121 von 126: Lecture Notes in Economics and Mathematical Systems

Kuschel, Torben

 
9783319402888: Capacitated Planned Maintenance: Models, Optimization Algorithms, Combinatorial and Polyhedral Properties (Lecture Notes in Economics and Mathematical Systems, Band 686)

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

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

Von der hinteren Coverseite

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.