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

Libro 121 di 126: Lecture Notes in Economics and Mathematical Systems

Kuschel, Torben

 
9783319402888: Capacitated Planned Maintenance: Models, Optimization Algorithms, Combinatorial and Polyhedral Properties: 686
Brossura
ISBN 10: 3319402889 ISBN 13: 9783319402888
Casa editrice: Springer, 2016

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Informazioni sull?autore

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

Dalla quarta di copertina

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.

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Springer
Data di pubblicazione
2016
Lingua
Inglese
ISBN 10 
3319402889
ISBN 13 
9783319402888
Rilegatura
Copertina flessibile
Numero edizione
1
Numero di pagine
316
Contatto del produttore
Springer Nature Customer Service Center GmbH
ProductSafety@springernature.com

Europaplatz 3
Heidelberg
69115
Germania